763 search results - page 39 / 153 » Engineering Shortest Path Algorithms |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
INFOCOM
2010
IEEE
13 years 6 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...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
LATIN
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...