Experimental Analysis of Treewidth

DOI10.1007/978-3-030-42071-0_15OpenAlexW3018950526MaRDI QIDQ5042459

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)

Cites Work

• Unnamed Item
• Listing all potential maximal cliques of a graph
• Treewidth computation and extremal combinatorics
• Positive-instance driven dynamic programming for treewidth
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• On exact algorithms for treewidth
• Complexity of Finding Embeddings in a k-Tree

This page was built for publication: Experimental Analysis of Treewidth