Anzeige
Erschienen in:
1995 | ReviewPaper | Buchkapitel
Tree-width and path-width of comparability graphs of interval orders
verfasst von : Renate Garbe
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The problem to decide whether the tree-width of a comparability graph is less than k is NP-complete, if k is part of the input. We prove that the tree-width of comparability graphs of interval orders can be determined in linear time and that it equals the path-width of the graph. Our proof is constructive, i.e., we give an explicit path decomposition of the graph.