2294 search results - page 126 / 459 » From Path Graphs to Directed Path Graphs |
133
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
101
click to vote
EJC
2010
15 years 2 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
106
Voted
CPC
2007
15 years 2 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
123
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
216
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...