41 search results - page 8 / 9 » Testing Expansion in Bounded Degree Graphs |
102
click to vote
GD
2009
Springer
15 years 6 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
117
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
129
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
121
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
135
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...