Results 141 to 150 of about 13,679 (262)
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
Parameterized Edge Hamiltonicity
, 2014 We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi +27 more
core +1 more source
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables [PDF]
, 2016 We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences.
Corani, Giorgio +3 more
core +1 more source
Pre-processing for Triangulation of Probabilistic Networks [PDF]
, 2013 The currently most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations forprobabilistic networks, that is ...
Bodlaender, Hans L. +3 more
core +2 more sources
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
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 +6 more sources
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
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
Treewidth versus clique number. II. Tree-independence number [PDF]
J. Comb. Theory B, 2021 Clément Dallard +2 more
semanticscholar +1 more source