Experimental Analysis of Treewidth

DOI10.1007/978-3-030-42071-0_15MaRDI QIDQ5042459zbMATH OpenOpenAlexFDO

Authors Hisao Tamaki

Publication date 19 October 2022

Published in Treewidth, Kernels, and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-42071-0_15

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Treewidth: Characterizations, Applications, and Computations
• scientific article; zbMATH DE number 7310078
• SOFSEM 2005: Theory and Practice of Computer Science
• Computational aspects of treewidth for graph
• An Experimental Study of the Treewidth of Real-World Graph Data

Cites work

• Complexity of Finding Embeddings in a k-Tree
• Listing all potential maximal cliques of a graph
• On exact algorithms for treewidth
• Positive-instance driven dynamic programming for treewidth
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Treewidth and minimum fill-in: Grouping the minimal separators
• Treewidth computation and extremal combinatorics

Cited in

(1)

• Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey

This page was built for publication: Experimental Analysis of Treewidth

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