1542 search results - page 94 / 309 » The metamathematics of random graphs |
136
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
115
click to vote
JCO
2010
15 years 6 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
128
Voted
DAM
2000
15 years 1 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
101
click to vote
JMLR
2011
14 years 8 months ago
2011
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
111
Voted
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...