90 search results - page 4 / 18 » Finding the Most Vital Node of a Shortest Path |
DSN
2003
IEEE
14 years 24 days ago
2003
IEEE
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...
CPAIOR
2011
Springer
12 years 11 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
4OR
2010
13 years 5 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
CAD
2004
Springer
13 years 7 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 ...
SIAMCOMP
2008
13 years 7 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...