\textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
From MaRDI portal
Publication:516870
Recommendations
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- Algorithms – ESA 2004
- Complexity of Finding Embeddings in a k-Tree
- House of Graphs: a database of interesting graphs
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- On exact algorithms for treewidth
- Parameterized algorithms
- Practical graph isomorphism. II.
- Principles and Practice of Constraint Programming – CP 2004
- Treewidth computations. I: Upper bounds
- Treewidth computations. II. Lower bounds
- Treewidth: computational experiments
Cited in
(6)- Jdrasil: a modular library for computing tree decompositions
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Properties of large 2-crossing-critical graphs
- An Experimental Study of the Treewidth of Real-World Graph Data
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Tree decompositions and social graphs
This page was built for publication: \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516870)