552 search results - page 10 / 111 » Constrained Shortest Path Computation |
116
Voted
ATMOS
2010
15 years 2 months ago
2010
90
Voted
ITIIS
2010
14 years 10 months ago
2010
121
Voted
SODA
2010
ACM
16 years 1 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...
133
Voted
CNSR
2010
IEEE
15 years 7 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...
114
Voted
SIAMCOMP
2010
14 years 10 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...