3678 search results - page 70 / 736 » On the Stable Paths Problem |
IWSOS
2009
Springer
14 years 5 months ago
2009
Springer
The Internet consists of a constantly evolving complex hierarchical architecture where routers are grouped into autonomous systems (ASes) that interconnect to provide global connec...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
MICRO
2006
IEEE
14 years 5 months ago
2006
IEEE
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
IPL
2006
13 years 11 months ago
2006
We investigate the path model checking problem for the