103 search results - page 15 / 21 » Computing approximate shortest paths on convex polytopes |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
CAD
2004
Springer
13 years 6 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
PODC
2006
ACM
14 years 20 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...