390 search results - page 38 / 78 » Computing shortest paths for any number of hops |
158
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
115
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
DEBS
2007
ACM
15 years 5 months ago
2007
ACM
We present a prefix forwarding algorithm for content-based publish/subscribe systems. Our algorithm performs only one content-based match per message regardless of the number of r...
129
click to vote
IMC
2006
ACM
15 years 8 months ago
2006
ACM
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
148
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...