390 search results - page 26 / 78 » Computing shortest paths for any number of hops |
102
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
131
click to vote
CCCG
2008
15 years 3 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
142
Voted
HIPC
2007
Springer
15 years 5 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
119
Voted
SSD
2007
Springer
15 years 8 months ago
2007
Springer
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
128
Voted
SIGCOMM
2003
ACM
15 years 7 months ago
2003
ACM
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...