Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

ACM Transactions on Algorithms

Volumn 6, Issue 2, 2010, Pages

  Klein, Philip N ^a   Mozes, Shay ^a   Weimann, Oren ^b  

^a Brown Univerity   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Monge; Planar graphs; Replacement paths; Shortest paths

Indexed keywords

LINEAR SPACES; PLANAR GRAPH; REPLACEMENT PATHS; SHORTEST PATH; TIME ALGORITHMS;

GRAPH THEORY;

GRAPHIC METHODS;

EID: 77950798339     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1721837.1721846     Document Type: Article

References (20)

1. AGGARWAL, A., AND KLAWE, M. M. 1990. Applications of generalized matrix searching to geometric algorithms. Discr. Appl. Math. 27, 1-2, 3-23.
2. AGGARWAL, A., KLAWE, M. M., MORAN, S., SHOR, P., AND WILBER, R. 1987. Geometric applications of a matrix-searching algorithm. Algorithmica 2, 1,195-208.
3. COX, I., RAO, S., AND ZHONG, Y. 1996. Ratio regions: A technique for image segmentation. In Proceedings of the International Conference on Pattern Recognition. 557.
4. EMEK, Y., PELEG, D., AND RODITTY, L. 2008. A near-linear time algorithm for computing replacement paths in planar directed graphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08). 428-435.
5. FAKCHAROENPHOL, J., AND RAO, S. 2006. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72, 5, 868-889.
6. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3, 596-615.
7. GABOW, H. N., AND TARJAN, R. E. 1989. Faster scaling algorithms for network problems. SIAM J. Comput. 18, 5, 1013-1036.
8. GOLDBERG, A. V. 1995. Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24, 3, 494-504.
9. HENZINGER, M. R.,KLEIN, P. N., RAO, S., AND SUBRAMANIAN, S. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 1, 3-23.
10. ISHIKAWA, H., AND JERMYN, I. 2001. Region extraction from multiple images. In Proceedings of the 8th IEEE International Conference on Computer Vision. IEEE Computer Society, 509-516.
11. JERMYN, I. H., AND ISHIKAWA, H. 2001. Globally optimal regions and boundaries as minimum ratio weight cycles. IEEE Trans. Patt. Anal. Mach. Intell. 23, 10, 1075-1088.
12. JOHNSON, D. B. 1977. Efficient algorithms for shortest paths in sparse graphs. J. ACM 24, 1-13.
13. KLAWE, M. M., AND KLEITMAN, D. J. 1990. An almost linear time algorithm for generalized matrix searching. SIAM J. Discr. Math. 3, 1, 81-97.
14. KLEIN, P. N. 2005. Multiple-Source shortest paths in planar graphs. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 146-155.
15. LIPTON, R. J., ROSE, D. J., AND TARJAN, R. E. 1979. Generalized nested dissection. SIAM J. Numer. Anal. 16, 346-358.
16. LIPTON, R. J., AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 2, 177-189.
17. MILLER, G. L. 1986. Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32, 3, 265-279.
18. MILLER, G. L., AND NAOR, J. 1995. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24, 5, 1002-1017.
19. MONGE, G. 1781. Ḿemoire sur la th́eorie des d'eblais et ramblais. Mem. Math. Phys. Acad. Roy. Sci. Paris, 666-704.
20. VEKSLER, O. 2002. Stereo correspondence with compact windows via minimum ratio cycle. IEEE Trans. Patt. Anal. Mach. Intell. 24, 12, 1654-1660.