Exact algorithms for dominating induced matching based on graph partition (Q2352792): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matchings for \(P_7\)-free graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the dominating induced matching problem in hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect edge domination and efficient edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination problem on some perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined exact algorithm for edge dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs / rank
 
Normal rank

Latest revision as of 12:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for dominating induced matching based on graph partition
scientific article

    Statements

    Exact algorithms for dominating induced matching based on graph partition (English)
    0 references
    0 references
    0 references
    6 July 2015
    0 references
    exact algorithms
    0 references
    graph algorithms
    0 references
    graph partition
    0 references
    branch-and-reduce
    0 references
    dominating induced matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references