Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
, 2020 Daniel Wiebking
openalex +2 more sources
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem [PDF]
, 2014 Daniel J. Harvey, David R. Wood
openalex +1 more source
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth [PDF]
, 2023 Isja Mannens, Jesper Nederlof
openalex +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
, 1993 This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of a graph is a good indication whether one can obtain a solution within reasonable time. A necessary ingredient is a treedecomposition of the graph with small width.
openaire +1 more source
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics [PDF]
, 2021 Éric Goles +3 more
openalex +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Treewidth in non-ground answer set solving and alliance problems in graphs
, 2017 Bernhard Bliem
openalex +2 more sources
Approximation algorithms for network design and cut problems in bounded-treewidth
, 2020 Daniel Vaz
openalex +1 more source