Results 31 to 40 of about 4,776 (247)
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth [PDF]
Symposium on the Theory of Computing, 2022 We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth-r graph, there exists a (fractional) multicommodity flow of value f, and a multicut of capacity c such that f
T. Friedrich +4 more
semanticscholar +1 more source
The treewidth and pathwidth of graph unions [PDF]
SIAM Journal on Discrete Mathematics, 2022 Given two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$ and $G_2$? Our main result is a negative answer to this question, in a strong sense: we show that
Bogdan Alecu +5 more
semanticscholar +1 more source
Computing Treewidth on the GPU
arXiv, 2017 We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm is based on an $O^*(2^{n})$-time algorithm that explores the elimination orderings of the graph using a Held-Karp like dynamic programming approach.
Tom C. van der Zanden +1 more
openalex +8 more sources
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width [PDF]
Logical Methods in Computer Science, 2013 Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small.
John Fearnley, Sven Schewe
doaj +1 more source
Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth [PDF]
Advances in Combinatorics, 2021 A _theta_ is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family $\mathcal{H}$ of graphs, we say a graph $G$ is $\mathcal{H}$-_free_ if no induced subgraph of $G$ is ...
Tara Abrishami +3 more
semanticscholar +1 more source
Treewidth of Grid Subsets [PDF]
Combinatorica, 2017 15 pages, no ...
Sergey Norin +2 more
openaire +2 more sources
On the Treewidth of Dynamic Graphs [PDF]
Theoretical Computer Science, 2013 Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to identify the graph properties that can be preserved over time and understand their respective computability.
Bernard Mans, Luke Mathieson
openaire +4 more sources
Metric Dimension Parameterized By Treewidth [PDF]
Algorithmica, 2021 AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer.
Édouard Bonnet +2 more
openaire +7 more sources
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
Recent Advances in Positive-Instance Driven Graph Searching
Algorithms, 2022 Research on the similarity of a graph to being a tree—called the treewidth of the graph—has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017).
Max Bannach, Sebastian Berndt
doaj +1 more source