Hardness and approximation of minimum maximal matchings (Q2935383): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-maximal matching in series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly matchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 12:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Hardness and approximation of minimum maximal matchings
scientific article

    Statements

    Hardness and approximation of minimum maximal matchings (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    regular graphs
    0 references
    NP-completeness
    0 references
    approximation
    0 references
    0 references