9572 search results - page 50 / 1915 » Cover Algorithms and Their Combination |
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
MST
2007
13 years 9 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
COLT
1995
Springer
14 years 1 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
WECWIS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a ...