Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degenerate matchings and edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphs with maximum induced matching and maximum matching the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the maximum induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely restricted matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the acyclic matching number of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some hard and some tractable cases of the maximum acyclic matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally searching for large induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized subgraph-restricted matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in subcubic graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Graphs of Bounded Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Graphs of Degree at Most 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating weighted induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability results for the maximum and minimum maximal induced matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two greedy consequences for maximum induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944970 / rank
 
Normal rank

Latest revision as of 01:00, 25 July 2024

scientific article
Language Label Description Also known as
English
Approximating maximum acyclic matchings by greedy and local search strategies
scientific article

    Statements

    Approximating maximum acyclic matchings by greedy and local search strategies (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2021
    0 references
    acyclic matching
    0 references
    induced matching
    0 references
    greedy algorithm
    0 references
    local search
    0 references
    0 references

    Identifiers