Results 121 to 130 of about 1,532 (205)
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +1 more source
Space-Efficient Vertex Separators for Treewidth [PDF]
, 2022 Frank Kammer +2 more
openalex +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
The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations
AlgorithmsTree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width
Frank Gurski, Robin Weishaupt
doaj +1 more source
Treewidth versus clique number. II. Tree-independence number
, 2023 Clément Dallard +2 more
openalex +1 more source
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness [PDF]
Barış Can Esmer +3 more
openalex +1 more source
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results [PDF]
, 2023 Jacob Focke +6 more
openalex +1 more source
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source
Treewidth in non-ground answer set solving and alliance problems in graphs
, 2017 Bernhard Bliem
openalex +2 more sources
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth [PDF]
, 2014 Marek Cygan +3 more
openalex +1 more source