Results 121 to 130 of about 4,791 (239)
Subcubic graphs of large treewidth do not have the edge-Erdős-Pósa property [PDF]
, 2023 Raphael Steck, Henning Bruhn
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
An Improvement of Reed’s Treewidth Approximation
, 2022 Mahdi Belbasi, Martin Fürer
openalex +1 more source
Journal of Combinatorial Theory, Series B, 2018 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
Causal Unit Selection using Tractable Arithmetic Circuits
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceThe 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
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth [PDF]
Discrete Mathematics, 2022 Chunqi Liu
semanticscholar +1 more source
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
Heuristic computation of exact treewidth
, 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
The $k$-path coloring problem in graphs with bounded treewidth: an\n application in integrated circuit manufacturing [PDF]
, 2019 Dehia Ait-Ferhat +3 more
openalex +1 more source
Attractor detection and enumeration algorithms for Boolean networks. [PDF]
Comput Struct Biotechnol J, 2022 Mori T, Akutsu T.
europepmc +1 more source