2294 search results - page 5 / 459 » From Path Graphs to Directed Path Graphs |
COCOON
2001
Springer
14 years 7 days ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
ALGORITHMICA
2011
13 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
SIAMDM
2000
13 years 7 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...