Skip to main content
SpringerLink
Log in

Dynamic algorithms for shortest paths in planar graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 570))

Included in the following conference series:

Abstract

We propose data structures for maintaining shortest path in planar graphs in which the weight of an edge is modified. Our data structures allow us to compute after an update the shortest-path tree rooted at an arbitrary query node in time O(n√log log n) and to perform an update in O((log n)3). Our data structure can be also applied to the problem of maintaining the maximum flow problem in an s − t planar network.

As far as the all pairs shortest path problem is concerned, we are interested in computing the shortest distances between q pairs of nodes after the weight of an edge has been modified. We obtain different bounds depending on q. We also obtain an algorithm that compares favourably with the best off-line algorithm for computing the all pairs shortest path if we are interested in computing only a subset of the O(n 2) possible pairs. Namely, we show how to obtain an o(n 2) algorithm for computing the shortest path between q pairs of nodes whenever q=o(n 2).

Work supported by the ESPRIT II Basic Research Action Program of the European Community under contract No.3075 (Project ALCOM) and by MURST project Algoritmi e Strutture di calcolo.

On leave from ESLAI (Escuela Superior Latinoamericana de Informática), partially supported by a grant from Fundación Antorchas, Argentina.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, U. Nanni, Incremental algorithms for for minimal length paths, Proc. 1 ACM-SIAM Symp. on Discrete Algorithms, S.Francisco, 1990.

    Google Scholar 

  2. M. D. Carroll and B. C. Ryder, Incremental data flow analysis via dominator and attribute grammars, Proc. 15th Annual ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, 1988.

    Google Scholar 

  3. G. Di Battista and R.Tamassia, Incremental planarity testing, Proc. 30th annual Symp. on Foundations of Computer Science, 1989.

    Google Scholar 

  4. G. Di Battista and R.Tamassia, On-line graph algorithms with SPQR-trees, Proc. 17th Int. Coll. on Automata, Languages and Programming, Lect. Not. in Comp. Sci., Springer-Verlag, 1990

    Google Scholar 

  5. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math., 1 (1959), pp. 269–271

    Article  Google Scholar 

  6. H.N. Djidjev, G.E. Pantziou, C.D. Zaroliagis, Computing Shortest Paths and Distances in Planar Graphs, Proc. ICALP 1991, Madrid, to appear in Lect. Not. in Comp. Sci. Springer-Verlag.

    Google Scholar 

  7. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, M. Young, Maintenance of a minimum spanning forest in a dynamic planar graph, Proc. 1 ACM-SIAM Symp. on Discrete Algorithms, S.Francisco, 1990.

    Google Scholar 

  8. S. Even and H. Gazit, Updating distances in dynamic graphs, Methods of Operations Research 49, 1985.

    Google Scholar 

  9. M. L. Fredman and R. E. Tarjan, Fibonacci Heaps and their uses in improved Network optimization algorithms, Proc. 25th. IEEE Symp. on Foundations of Computer Science, Singer Island, Oct. 1984, pp. 338–346

    Google Scholar 

  10. G. N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM Journal Computing, 16 (1987), pp. 1004–1022

    Google Scholar 

  11. G. N. Frederickson, A new approach to all pairs shortes path in planar graphs, Proc. 19th ACM STOC, New York City, (1987), pp. 19–28.

    Google Scholar 

  12. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969

    Google Scholar 

  13. R. Hassin, Maximum flow in (s,t) planar networks, Inform. Process. Letters, 13 (1981), p. 107.

    Google Scholar 

  14. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177–189.

    Article  Google Scholar 

  15. C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization, Algorithms and Complexity, Prentice Hall, 1982.

    Google Scholar 

  16. H. Rohnert, A dynamization of the all-pairs least cost path problem, Proc. of the 2nd Symp. on Theoretical aspects of Computer Science, Lect. Not. in Comp. Sci., vol. 182, Springer-Verlag, 1990.

    Google Scholar 

  17. J. Westbrook, Algorithms and data structures for dynamic graph problems, Ph.D. Dissertation, Tech. Rep. CS-TR-229-89, Dept. of Computer Science, Princeton University, 1989.

    Google Scholar 

  18. M. Yannakakis, Graph Theoretic methods in database theory, Proc. ACM Conf. on Principles of database Systems, 1990.

    Google Scholar 

  19. D. M. Yellin and R. Strom, INC: a language for incremental computations, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy

    Esteban Feuerstein

  2. Dipartimento di Matematica, Università dell'Aquila, L'Aquila, Italy

    Alberto Marchetti-Spaccamela

Authors
  1. Esteban Feuerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gunther Schmidt Rudolf Berghammer

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feuerstein, E., Marchetti-Spaccamela, A. (1992). Dynamic algorithms for shortest paths in planar graphs. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-55121-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55121-8

  • Online ISBN: 978-3-540-46735-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation