313 search results - page 51 / 63 » Shortest Paths in Distance-regular Graphs |
129
Voted
DM
1998
15 years 3 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
107
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
137
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
244
click to vote
GIS
2006
ACM
16 years 4 months ago
2006
ACM
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
103
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...