A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

DOI10.1007/S00453-001-0091-XMaRDI QIDQ1348907zbMATH OpenOpenAlexFDO

Authors Ton Kloks, Dieter Kratsch, Haiko Müller, Hajo Broersma

Publication date 21 May 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0091-x

zbMATH Keywords

asteroidal tripleasteroidal set

Mathematics Subject Classification ID

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

Recommendations

• Publication:4232780
• Independent Sets in Asteroidal Triple-Free Graphs
• Independent sets in asteroidal triple-free graphs
• Domination and total domination on asteroidal triple-free graphs
• On treewidth and minimum fill-in of asteroidal triple-free graphs

Cited in

(7)

• Computing the branchwidth of interval graphs
• Vertex ranking of asteroidal triple-free graphs
• scientific article; zbMATH DE number 7310078 (Why is no real title available?)
• Feedback vertex set on AT-free graphs
• On treewidth approximations.
• On asteroidal sets in chordal graphs
• The firefighter problem on graph classes

This page was built for publication: A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

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