Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-016-0150-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2342665464 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1908.00978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
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: Finding a maximum induced matching in weakly chordal 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: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matchings in graphs containing no long claw / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matchings in graphs without a skew star / 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: Algorithms for weakly triangulated graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-016-0150-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:22, 9 December 2024

scientific article
Language Label Description Also known as
English
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
scientific article

    Statements

    Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2017
    0 references
    dominating induced matching
    0 references
    efficient edge domination
    0 references
    \(P_8\)-free graphs
    0 references
    polynomial time algorithm
    0 references

    Identifiers

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