scientific article; zbMATH DE number 1107735

MaRDI QIDQ4373684zbMATH OpenFDO

Authors Ton Kloks, Dieter Kratsch, Haiko Müller

Publication date 19 October 1998

zbMATH Keywords

asteroidal numberastervoidal setefficient algorithmsNP-complete

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 5717213
• Independent sets in asteroidal triple-free graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
• Publication:4944994

Cited in

(16)

• Induced matchings in asteroidal triple-free graphs
• On the powers of graphs with bounded asteroidal number
• On claw-free asteroidal triple-free graphs
• On polygon numbers of circle graphs and distance hereditary graphs
• On asteroidal sets in chordal graphs
• On the structure of graphs with bounded asteroidal number
• Edge-dominating trails in AT-free graphs (extended abstract)
• A decomposition theorem for chordal graphs and its applications
• scientific article; zbMATH DE number 5717213 (Why is no real title available?)
• Reduced clique graphs of chordal graphs
• Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
• Asteroidal triples of moplexes
• Approximating Pathwidth for Graphs of Small Treewidth
• Graphs with at most two moplexes
• Obstructions to faster diameter computation: asteroidal sets
• Asteroidal quadruples in non rooted path 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 Q4373684)