126 search results - page 13 / 26 » More Algorithms for All-Pairs Shortest Paths in Weighted Gra... |
ICCV
2009
IEEE
15 years 16 days ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
SWAT
1998
Springer
13 years 11 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
ATMOS
2007
13 years 9 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...