scientific article; zbMATH DE number 1107726

MaRDI QIDQ4373674zbMATH OpenFDO

Authors Elias Dahlhaus, Ton Kloks, Hajo Broersma

Publication date 23 June 1998

zbMATH Keywords

HHD-free graphstreewidth problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding houses and holes in graphs
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
• An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
• A local reductive elimination for the fill-in of graphs
• Maximum induced matching problem on hhd-free graphs

Cited in

(7)

• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Dynamic Programming for H-minor-free Graphs
• An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
• Induced embeddings into Hamming graphs
• Finding houses and holes in graphs
• Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
• A new characterization of HH-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373674)