871 search results - page 6 / 175 » The vertex-cover polynomial of a graph |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
CC
2007
Springer
14 years 12 months ago
2007
Springer
NETWORKS
2000
14 years 11 months ago
2000
STOC
2002
ACM
16 years 5 days 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...