Special issue: Treewidth

DOI10.1007/S004530010015MaRDI QIDQ1578399zbMATH OpenOpenAlexFDO

Authors

Publication date 28 January 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010015

zbMATH Keywords

Special issueTreewidth

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)

Recommendations

• scientific article; zbMATH DE number 1361465
• Treewidth: Characterizations, Applications, and Computations
• Treewidth: Structure and Algorithms
• On treewidth approximations
• Computing tree width: from theory to practice and back
• Treewidth computations. I: Upper bounds
• Computational aspects of treewidth for graph
• scientific article; zbMATH DE number 7310078
• The algorithmic theory of treewidth

Cited in

(1)

• Safe separators for treewidth

This page was built for publication: Special issue: Treewidth

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