Simple distributed algorithms for the cycle cutset problem

Authors:
Arun Jagota;Rina Dechter
Affiliations:
Dept of Computer Science, University of California, Santa Cruz, CA;Dept of Computer Sciences, University of California, Irvine, CA
Venue:
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Year:
1997

Citing 9
Cited 1

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Fusion, propagation, and structuring in belief networks

Artificial Intelligence
Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem

Complex Systems
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Implementing discrete mathematics: combinatorics and graph theory with Mathematica

Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem

Artificial Intelligence
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract