Fusion, propagation, and structuring in belief networks
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Probabilistic inference in multiply connected belief networks using loop cutsets
International Journal of Approximate Reasoning
Fusion and propagation with multiple observations in belief networks
Artificial Intelligence
Computation and action under bounded resources
Computation and action under bounded resources
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
A note on approximation of the vertex cover and feedback vertex set problems—unified approach
Information Processing Letters
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Causal networks: semantics and expressiveness
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Ideal reformulation of belief networks
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Faster fixed parameter tractable algorithms for finding feedback vertex sets
ACM Transactions on Algorithms (TALG)
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Tractable feedback vertex sets in restricted bipartite graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Directed subset feedback vertex set is fixed-parameter tractable
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Feedback vertex sets on restricted bipartite graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inference. Our randomized algorithm for finding a loop cutset outputs a minimum loop cutset after O(c 6kkn) steps with probability at least 1 - (1 - 1/6k)c6k, where c 1 is a constant specified by the user, k is the minimal size of a minimum weight loop cutset, and n is the number of vertices. We also show empirically that a variant of this algorithm often finds a loop cutset that is closer to the minimum weight loop cutset than the ones found by the best deterministic algorithms known.