410 search results - page 30 / 82 » Upgrading Shortest Paths in Networks |
114
click to vote
WSDM
2010
ACM
15 years 10 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
JCT
1998
15 years 1 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
109
click to vote
SDM
2012
SIAM
13 years 3 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
141
click to vote
TMC
2012
13 years 3 months ago
2012
—We present the boomerang protocol to efficiently retain information at a particular geographic location in a sparse network of highly mobile nodes without using infrastructure ...
142
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...