829 search results - page 69 / 166 » Distance domination-critical graphs |
227
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
151
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
194
click to vote
CCR
2010
15 years 6 months ago
2010
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
176
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
194
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...