Results 121 to 130 of about 11,104 (228)
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard) [PDF]
Dániel Marx +2 more
openalex +1 more source
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth [PDF]
Falko Hegerfeld, Stefan Kratsch
openalex +1 more source
Fast simulation of planar Clifford circuits [PDF]
A 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
An Improvement of Reed’s Treewidth Approximation
Mahdi Belbasi, Martin Fürer
openalex +1 more source
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
Daniel J. Harvey, David R. Wood
openaire +2 more sources
(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth
Davi de Andrade, Ana Silva
openalex +2 more sources
Subcubic graphs of large treewidth do not have the edge-Erdős-Pósa property [PDF]
Raphael Steck, Henning Bruhn
openalex +1 more source
Causal Unit Selection using Tractable Arithmetic Circuits
The unit selection problem aims to find objects, called units, that optimize a causal objective function which describes the objects' behavior in a causal context (e.g., selecting customers who are about to churn but would most likely change their mind ...
Haiying Huang, Adnan Darwiche
doaj +1 more source
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs [PDF]
Sally Dong, Guanghao Ye
openalex +1 more source
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem [PDF]
Daniel J. Harvey, David R. Wood
openalex +1 more source

