8 search results - page 2 / 2 » Disjoint Paths in Densely Embedded Graphs |
SIAMDM
2000
13 years 5 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
FOCS
2009
IEEE
14 years 15 days 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...
IPSN
2011
Springer
12 years 9 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...