829 search results - page 48 / 166 » Distance domination-critical graphs |
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
ACCV
2007
Springer
15 years 6 months ago
2007
Springer
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...