2006 | OriginalPaper | Buchkapitel
Treewidth: Characterizations, Applications, and Computations
verfasst von : Hans L. Bodlaender
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
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
This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.