Planar graphs, negative weight edges, shortest paths, and near linear time

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 232-241

  Fakcharoenphol, J ^a   Rao, S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

SHORTEST PATH PROBLEMS;

GRAPH THEORY;

EID: 0035167358     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959897     Document Type: Conference Paper

References (17)

1. Efficient minimum cost matching and transportation using the quadrangle inequality
2. On a routing problem
3. Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
4. 'Ratio regions': A technique for image segmentation
5. Dynamic programming for detecting, tracking and matching elastic contours
6. Computing shortest paths and distances in planar graphs
7. A new approach to all pairs shortest paths in planar graphs (extended abstract)
8. Fast algorithms for shortest paths in planar graphs, with applications
9. Faster scaling algorithm for network problems
10. Scaling algorithms for the shortest path problem
11. Faster shortest-path algorithms for planar graphs
12. Generalized nested dissection
13. A separator theorem for planar graphs
14. Flow in planar graphs with multiple sources and sinks
15. The discrete geodesic problem
16. Faster algorithms for finding small edge cuts in planar graphs (extended abstract)