\textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions

DOI10.1016/j.dam.2016.09.023zbMath1358.05002OpenAlexW2527780360MaRDI QIDQ516870

Rim van Wersch, Steven Kelk

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.023

zbMATH Keywords

algorithmsdatabasetreewidthgraphstree decomposition

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

Properties of Large 2-Crossing-Critical Graphs ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• nauty
• House of Graphs
• Traces
• ComputeTW
• ToTo
• LibTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• AND-compression of NP-complete problems: streamlined proof and minor observations
• Treewidth computations. II. Lower bounds
• Treewidth computations. I: Upper bounds
• House of Graphs: a database of interesting graphs
• Practical graph isomorphism. II.
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• On exact algorithms for treewidth
• Complexity of Finding Embeddings in a k-Tree
• A large database of graphs and its use for benchmarking graph isomorphism algorithms
• Algorithms – ESA 2004
• Parameterized Algorithms
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions