Skip to main content
SpringerLink
Log in

Single-Source Fully Dynamic Reachability

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 37 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Demetrescu C, Italiano G (2005) Trade-offs for fully dynamic reachability on dags: breaking through the O(n2) barrier. J Assoc Comput Mach 52:147–156

    Article  MathSciNet  MATH  Google Scholar 

  2. Sankowski P (2004) Dynamic transitive closure via dynamic matrix inverse. In: FOCS '04: proceedings of the 45th annual IEEE symposium on foundations of computer science (FOCS'04). IEEE Computer Society, Washington, DC, pp 509–517

    Google Scholar 

  3. Yannakakis M (1990) Graph-theoretic methods in database theory. In: Proceedings of the 9-th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Nashville, pp 230–242

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Systems Science, University of Rome, Rome, Italy

    Camil Demetrescu & Giuseppe F. Italiano

  2. Department of Information and Computer Systems, University of Rome, Rome, Italy

    Camil Demetrescu & Giuseppe F. Italiano

Authors
  1. Camil Demetrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camil Demetrescu .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Demetrescu, C., Italiano, G.F. (2016). Single-Source Fully Dynamic Reachability. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_376

Download citation

Publish with us

Policies and ethics

Search

Navigation