Results 101 to 110 of about 13,814 (224)
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2022 Marthe Bonamy +7 more
semanticscholar +1 more source
Regular resolution for CNF of bounded incidence treewidth with few long clauses
, 2019 We demonstrate that Regular Resolution is FPT for two restricted families of CNFs of bounded incidence treewidth. The first includes CNFs having at most $p$ clauses whose removal results in a CNF of primal treewidth at most $k$.
Cali, Andrea, Razgon, Igor
core
Quantum speedups for treewidth
, 2022 In this paper, we study quantum algorithms for computing the exact value of the treewidth of a graph. Our algorithms are based on the classical algorithm by Fomin and Villanger (Combinatorica 32, 2012) that uses $O(2.616^n)$ time and polynomial space. We show three quantum algorithms with the following complexity, using QRAM in both exponential space ...
Kļevickis, Vladislavs +2 more
openaire +4 more sources
International Journal of Foundations of Computer Science, 1993 In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number.
openaire +7 more sources
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth [PDF]
Discrete Mathematics, 2022 Chunqi Liu
semanticscholar +1 more source
Journal of Graph Theory, 2016 AbstractTreewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This article surveys several graph parameters tied to treewidth, including separation number, tangle number, well‐linked number, and Cartesian tree product number.
Daniel J. Harvey, David R. Wood
openaire +4 more sources
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source
Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs [PDF]
, 1998 Elias Dahlhaus
openalex +1 more source
The treewidth and pathwidth of hypercubes
Discrete Mathematics, 2006 AbstractThe d-dimensional hypercube, Hd, is the graph on 2d vertices, which correspond to the 2d d-vectors whose components are either 0 or 1, two of the vertices being adjacent when they differ in just one coordinate. The notion of Hamming graphs (denoted by Kqd) generalizes the notion of hypercubes: The vertices correspond to the qd d-vectors where ...
L. Sunil Chandran, Telikepalli Kavitha
openaire +2 more sources
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Algorithms Mol Biol, 2022 Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source