1493 search results - page 24 / 299 » Local resilience of graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
EJC
2010
13 years 7 months ago
2010
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...