390 search results - page 70 / 78 » Computing shortest paths for any number of hops |
JCO
2011
14 years 6 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
ICPADS
2006
IEEE
15 years 5 months ago
2006
IEEE
Several IP Traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an ef...
101
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
83
Voted
RSA
2010
14 years 10 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
EMMCVPR
2001
Springer
15 years 4 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...