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

Journal of Computer and System Sciences

Volumn 72, Issue 5, 2006, Pages 868-889

  Fakcharoenphol, Jittat ^a   Rao, Satish ^b  

^a KASETSART UNIVERSITY   (Thailand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Negative edge weights; Planar graphs; Shortest paths

Indexed keywords

DATA ACQUISITION; DATA STRUCTURES; GRAPH THEORY; POLYNOMIALS;

NEGATIVE EDGE WEIGHTS; PLANAR GRAPHS; SHORTEST PATHS;

ALGORITHMS;

EID: 33646503679     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.05.007     Document Type: Article

References (27)

1. I.J. Cox, S.B. Rao, Y. Zhong, 'Ratio regions': A technique for image segmentation, in: Proceedings International Conference on Pattern Recognition, IEEE, 1996, pp. 557-564
2. Geiger L.C.D., Gupta A., and Vlontzos J. Dynamic programming for detecting, tracking and matching elastic contours. IEEE Trans. Pattern Anal. Mach. Intell. 17 3 (1995) 294-302
3. S.B. Rao, Faster algorithms for finding small edge cuts in planar graphs, extended abstract, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, 1992, pp. 229-240
4. Miller G., and Naor J. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24 (1995) 1002-1017
5. Chalermsook P., Fakcharoenphol J., and Nanongkai D. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA '04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2004), Society for Industrial and Applied Mathematics, Philadelphia, PA 828-829
6. Bellman R.E. On a routing problem. Quart. Appl. Math. 16 (1958) 87-90
7. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton Univ. Press, Princeton, NJ
8. Gabow H.N., and Tarjan R.E. Faster scaling algorithm for network problems. SIAM J. Comput. 18 5 (1989) 1013-1036
9. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1 (1959) 269-271
10. Lipton R.J., and Tarjan R.E. A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979) 177-189
11. Lipton R., Rose D., and Tarjan R.E. Generalized nested dissection. SIAM J. Numer. Anal. 16 (1979) 346-358
12. Goldberg A.V. Scaling algorithms for the shortest path problem. SIAM J. Comput. 21 1 (1992) 140-150
13. Henzinger M.R., Klein P.N., Rao S., and Subramanian S. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55 1 (1997) 3-23
14. W.D. Smith, private communication, 2005
15. Hutchinson J.P., and Miller G.L. Deleting vertices to make graphs of positive genus planar. Discrete Algorithms and Complexity Theory (1986), Academic Press, Boston 81-98
16. Djidjev H., and Venkatesan S.M. Planarization of graphs embedded on surfaces. WG '95: Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science (1995), Springer-Verlag, London, UK 62-72
17. Frederickson G.N. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16 6 (1989) 1004-1022
18. Thorup M. Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51 6 (2004) 993-1024
19. P.N. Klein, Multiple-source shortest paths in planar graphs, in: Proceedings, 16th ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 146-155
20. G.N. Frederickson, A new approach to all pairs shortest paths in planar graphs, extended abstract, in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 19-28
21. Djidjev H.N., Pantziou G.E., and Zaroliagis C.D. Computing shortest paths and distances in planar graphs. Proc. 18th ICALP (1991), Springer-Verlag 327-339
22. Aggarwal A., Bar-Noy A., Khuller S., Kravets D., and Schieber B. Efficient minimum cost matching and transportation using the quadrangle inequality. J. Algorithms 19 1 (1995) 116-143
23. Buss S.R., and Yianilos P.N. Linear and O ( n log n ) time minimum-cost matching algorithms for quasi-convex tours. SIAM J. Comput. 27 1 (1998) 170-201
24. Mitchell J.S.B., Mount D.M., and Papadimitriou C.H. The discrete geodesic problem. SIAM J. Comput. 16 4 (1987) 647-668
25. Johnson D. Efficient algorithms for shortest paths in sparse networks. J. Assoc. Comput. Mach. 24 (1977) 1-13
26. de Berg M., van Kreveld M., Overmars M., and Schwarzkopt O. Computational Geometry: Algorithms and Applications. second ed. (2000), Springer-Verlag pp. 96-99 (Chapter 5)
27. Miller G.L. Finding small simple cycle separators for 2-connected planar graphs. J. Comput. System Sci. 32 3 (1986) 265-279