552 search results - page 10 / 111 » Constrained Shortest Path Computation |
ATMOS
2010
13 years 8 months ago
2010
ITIIS
2010
13 years 4 months ago
2010
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
CNSR
2010
IEEE
14 years 1 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
SIAMCOMP
2010
13 years 4 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...