Results 121 to 130 of about 11,505 (254)
Planar Disjoint Paths, Treewidth, and Kernels [PDF]
, 2023 Michał Włodarczyk, Meirav Zehavi
openalex +1 more source
Cop-width, flip-width and strong colouring numbers [PDF]
Discrete Mathematics & Theoretical Computer ScienceCop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width.
Robert Hickingbotham
doaj +1 more source
Hitting minors on bounded treewidth graphs. III. Lower bounds [PDF]
, 2021 Julien Baste +2 more
openalex +1 more source
On Treewidth and Stable Marriage
CoRR, 2017 Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems.
Sushmita Gupta +2 more
openaire +2 more sources
Heuristic computation of exact treewidth
CoRR, 2022 We are interested in computing the treewidth $\tw(G)$ of a given graph $G$. Our approach is to design heuristic algorithms for computing a sequence of improving upper bounds and a sequence of improving lower bounds, which would hopefully converge to $\tw(G)$ from both sides.
openaire +4 more sources
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard) [PDF]
, 2021 Dániel Marx +2 more
openalex +1 more source
Lower Bounds for the Complexity of Monadic Second-Order Logic
, 2010 Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter tractable in linear
Kreutzer, Stephan, Tazari, Siamak
core +2 more sources
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth [PDF]
, 2023 Falko Hegerfeld, Stefan Kratsch
openalex +1 more source
Fast simulation of planar Clifford circuits [PDF]
QuantumA general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset +3 more
doaj +1 more source
Approximating the Treewidth of AT-Free Graphs
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchitté, Vincent, Todinca, Ioan
openaire +4 more sources