Results 21 to 30 of about 5,860 (222)
Product structure of graph classes with bounded treewidth [PDF]
Combinatorics, probability & computing, 2022 We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph.
Rutger Campbell +10 more
semanticscholar +1 more source
A note on domino treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In [DO95], Ding and Oporowski proved that for every k, and d, there exists a constant c_k,d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c_k,d.
Hans L. Bodlaender
doaj +3 more sources
An Improved Parameterized Algorithm for Treewidth [PDF]
Symposium on the Theory of Computing, 2022 We give an algorithm that takes as input an n-vertex graph G and an integer k, runs in time 2O(k2) nO(1), and outputs a tree decomposition of G of width at most k, if such a decomposition exists.
T. Korhonen, D. Lokshtanov
semanticscholar +1 more source
Low Treewidth Embeddings of Planar and Minor-Free Metrics [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 Cohen-Addad, Filtser, Klein and Le [FOCS’20] constructed a stochastic embedding of minor-free graphs of diameter D into graphs of treewidth $O_{\epsilon}(\log n)$ with expected additive distortion $+\epsilon D$. Cohen-Addad et al. then used the embedding
Arnold Filtser, Hung Le
semanticscholar +1 more source
Constant Congestion Brambles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1) \cap V(H_2) \neq \emptyset$ or there is an edge of $G$ with one endpoint in $V(H_1)$ and the ...
Meike Hatzel +3 more
doaj +1 more source
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2023 The core chase, a popular algorithm for answering conjunctive queries (CQs) over existential rules, is guaranteed to terminate and compute a finite universal model whenever one exists, leading to the equivalence of the universal-model-based and the chase-
Jean-François Baget +2 more
semanticscholar +1 more source
Treewidth, Circle Graphs, and Circular Drawings [PDF]
SIAM Journal on Discrete Mathematics, 2022 A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'.
Robert Hickingbotham +3 more
semanticscholar +1 more source
Twin-width can be exponential in treewidth [PDF]
J. Comb. Theory B, 2022 For any small positive real $\varepsilon$ and integer $t>\frac{1}{\varepsilon}$, we build a graph with a vertex deletion set of size $t$ to a tree, and twin-width greater than $2^{(1-\varepsilon) t}$.
Édouard Bonnet, Hugues Déprés
semanticscholar +1 more source
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2022 We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutions in low-treewidth graphs.
Taisuke Izumi +3 more
semanticscholar +1 more source
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