Sciweavers

28 search results - page 1 / 6
» On Local Expansion of Vertex-Transitive Graphs
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 7 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
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...
Hang Dinh, Alexander Russell
COMBINATORICA
2006
69views more  COMBINATORICA 2006»
13 years 5 months ago
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
Wesley Pegden
FSTTCS
2009
Springer
13 years 12 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer