Skip to main content
SpringerLink
Log in

Randomization for Efficient Dynamic Graph Algorithms

(Invited Talk)

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9602))

Included in the following conference series:

  • 1282 Accesses

Abstract

In the last two decades, randomization has played a crucial role in the design of efficient algorithms for various problems on dynamic graphs. The aim of this article is to illustrate some of these randomization techniques in the context of these dynamic graph algorithms.

Surender Baswana — This research was partially supported by University Grants Commission of India and the Israel Science Foundation.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Choudhary, K., Baswana, S.: On dynamic DFS tree in directed graphs. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 102–114. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  2. Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in O(log \(n\)) update time. SIAM J. Comput. 44(1), 88–113 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baswana, S., Hariharan, R., Sen, S.: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2), 74–92 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baswana, S., Khurana, S., Sarkar, S.: Fully dynamic randomized algorithms for graph spanners. ACM Trans. Algorithms 8(4), 35 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. J. ACM 51(6), 968–992 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5), 669–696 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Even, S., Shiloach, Y.: An on-line edge-deletion problem. J. ACM 28(1), 1–4 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14(4), 781–798 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gottlieb, L.-A., Roditty, L.: Improved algorithms for fully dynamic geometric spanners and geometric routing. In: SODA, pp. 591–600 (2008)

    Google Scholar 

  10. Henzinger, M., Krinninger, S., Nanongkai, D.: Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: FOCS, pp. 146–155 (2014)

    Google Scholar 

  11. Henzinger, M., Krinninger, S., Nanongkai, D.: Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: STOC, pp. 674–683 (2014)

    Google Scholar 

  12. Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502–516 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723–760 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ivkovic, Z., Lloyd, E.L.: Fully dynamic maintenance of vertex cover. In: WG, pp. 99–111 (1994)

    Google Scholar 

  15. Kapron, B.M., King, V., Mountjoy, B.: Dynamic graph connectivity in polylogarithmic worst case time. In: SODA, pp. 1131–1142 (2013)

    Google Scholar 

  16. King, V., Sagert, G.: A fully dynamic algorithm for maintaining the transitive closure. J. Comput. Syst. Sci. 65(1), 150–167 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. SIAM J. Comput. 37(5), 1455–1471 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Roditty, L., Zwick, U.: Dynamic approximate all-pairs shortest paths in undirected graphs. SIAM J. Comput. 41(3), 670–683 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Thorup, M.: Decremental dynamic connectivity. J. Algorithms 33(2), 229–243 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. Thorup, M.: Worst-case update times for fully-dynamic all-pairs shortest paths. In: STOC, pp. 112–119 (2005)

    Google Scholar 

  21. Thorup, M.: Fully-dynamic min-cut. Combinatorica 27(1), 91–127 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The author is grateful to Keerti Choudhary for her valuable comments and suggestions on a preliminary draft of this article.

Author information

Authors and Affiliations

  1. Department of CSE, IIT Kanpur, Kanpur, India

    Surender Baswana

Authors
  1. Surender Baswana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Surender Baswana .

Editor information

Editors and Affiliations

  1. Indian Institute of Science, Bangalore, India

    Sathish Govindarajan

  2. Carleton University, Ottawa, ON, Canada

    Anil Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Baswana, S. (2016). Randomization for Efficient Dynamic Graph Algorithms. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29221-2_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29220-5

  • Online ISBN: 978-3-319-29221-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation