829 search results - page 108 / 166 » Distance domination-critical graphs |
105
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
SIGECOM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
120
click to vote
COMGEO
1999
ACM
14 years 11 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
PR
2007
14 years 11 months ago
2007
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...