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

DOI10.1007/S00453-001-0091-XzbMATH Open1009.68099OpenAlexW2105257834MaRDI QIDQ1348907FDOQ1348907

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

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

Recommendations

• scientific article; zbMATH DE number 1262790
• 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

zbMATH Keywords

asteroidal tripleasteroidal set

Mathematics Subject Classification ID

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

Cited In (7)

• On asteroidal sets in chordal graphs
• Vertex ranking of asteroidal triple-free graphs
• Feedback vertex set on AT-free graphs
• Computing the branchwidth of interval graphs
• The firefighter problem on graph classes
• Title not available (Why is that?)
• On treewidth approximations.

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)