Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1998: Algorithms — ESA’ 98 pp 368–380Cite as

An Experimental Study of Dynamic Algorithms for Directed Graphs

  • Conference paper
  • First Online:

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

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical study of dynamic graph algorithms. In ACM-SIAM Symposium on Discrete Algorithms, pp. 192–201, 1996.

    Google Scholar 

  2. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In ACM-SIAM Symp. on Discrete Alg., 1997.

    Google Scholar 

  3. D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis. A Software Library of Dynamic Graph Algorithms. In Proc. Workshop on Algorithms and Experiments — ALEX’98, 1998, pp.129–136.

    Google Scholar 

  4. T. Bates, E. Gerich, L. Joncheray, J-M. Jouanigot, D. Karrenberg, M. Terpstra, and J. Yu. Representation of IP routing policies in a routing registry. Technical report, RIPE-181, October 1994.

    Google Scholar 

  5. S. Cicerone, D. Frigioni, U. Nanni, and F. Pugliese. A uniform approach to semi dynamic problems in digraphs. Theoretical Computer Science, to appear.

    Google Scholar 

  6. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic output bounded single source shortest path problem. In ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 212–221.

    Google Scholar 

  7. M. R. Henzinger, and V. King. Fully dynamic biconnectivity and transitive closure. In IEEE Symposium on Foundations of Computer Science, 1995.

    Google Scholar 

  8. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Th. Comp. Sc., 48:273–281, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  9. G. F. Italiano. Finding paths and deleting edges in directed acyclic graphs. IPL, 28:5–11, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. A. La Poutré, and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Int. Work. on Graph-Theoretic Concepts in Comp. Sci., pages 106–120. Lect. Notes in Comp. Sci., 314, 1988.

    Google Scholar 

  11. K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96–102, 1995.

    Article  Google Scholar 

  12. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233–277, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, 30:369–384, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Daniele Frigioni, Tobias Miller, Guido Schaefer & Christos Zaroliagis

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italy

    Daniele Frigioni, Umberto Nanni & Giulio Pasqualone

  3. Department of Computer Science, King’s College, University of London Strand, London, WC2R 2LS, UK

    Christos Zaroliagis

Authors
  1. Daniele Frigioni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tobias Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giulio Pasqualone
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Guido Schaefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Christos Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frigioni, D., Miller, T., Nanni, U., Pasqualone, G., Schaefer, G., Zaroliagis, C. (1998). An Experimental Study of Dynamic Algorithms for Directed Graphs. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation