Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Combinatorial Algorithms

IWOCA 2015: Combinatorial Algorithms pp 148–160Cite as

Dynamic Subtrees Queries Revisited: The Depth First Tour Tree

  • Conference paper
  • First Online:

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

Abstract

In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing edges. Depending on the application, information can be associated to nodes or edges (or both), and queries might require to combine values in path or (sub)trees. In this paper we present a novel data structure, called the Depth First Tour Tree, based on a linearization of a DFS visit of the tree. Despite the simplicity of the approach, similar to the ET-Trees (based on a Euler Tour), our data structure is able to answer queries related to both paths and (sub)trees. In particular, focusing on subtree computations, we show how to customize the data structure in order to answer queries for a concrete application: keeping track of the biconnectivity measures, including the impact of the removal of articulation points, of a dynamic undirected graph.

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

Learn about institutional subscriptions

Notes

  1. 1.

    The extended paper can be found at http://arxiv.org/abs/1502.05292.

References

  1. Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: SODA (2004)

    Google Scholar 

  2. Acar, U.A., Blelloch, G.E., Vittes, J.L: An experimental analysis of change propagation in dynamic trees. In: ALENEX (2005)

    Google Scholar 

  3. Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: ICALpP (1997)

    Google Scholar 

  4. Alstrup, S., Holm, J., Lichtenberg, K.D., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2), 243–264 (2005)

    Article  MathSciNet  Google Scholar 

  5. Ausiello, G., Firmani, D. and Laura, L.: Real-time analysis of critical nodes in network cores. In: IWCMC (2012)

    Google Scholar 

  6. Thomas, H.C., Charles, E.L., Ronald, L.R., Clifford, S.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  7. Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)

    Book  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Frederickson, G.N.: Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J. Comput. 26(2), 484–538 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frederickson, G.N.: A data structure for dynamically maintaining rooted trees. J. Algorithms 24(1), 37–65 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Georgiadis, L., Kaplan, H., Shafrir, N., Tarjan, R.E., Werneck, R.F.: Data structures for mergeable trees. ACM Trans. Algorithms 7(2), 14 (2011)

    Article  MathSciNet  Google Scholar 

  12. Goldberg, A.V., Grigoriadis, M.D., Tarjan, R.E.: Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program 50(3), 277–290 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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 

  14. Joannou, S., Raman, R.: Dynamizing succinct tree representations. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 224–235. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: STOC (2003)

    Google Scholar 

  16. Langerman, S.: On the shooter location problem. In: CCCG (2000)

    Google Scholar 

  17. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762–776 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 16 (2014)

    Article  MathSciNet  Google Scholar 

  19. Radzik, T.: Implementation of dynamic trees with in-subtree operations. ACM J. Exp. Algorithms 3, 9 (1998)

    Article  MathSciNet  Google Scholar 

  20. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  21. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tarjan, R.E.: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program. 78(2), 169–177 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Tarjan, R.E., Werneck, R.F.: Self-adjusting top trees. In: SODA (2005)

    Google Scholar 

  24. Tarjan, R.E., Werneck, R.F.: Dynamic trees in practice. ACM J. Exp. Algorithmics 14, 5 (2009)

    Google Scholar 

  25. Werneck, R.F.: Design and analisys of data structures for dynamic trees. Ph.D thesis (2006)

    Google Scholar 

  26. Werneck, R.F.: Dynamic trees. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)

    Google Scholar 

  27. Westbrook, J., Tarjan, R.E.: Maintaining bridge-connected and biconnected components on-line. Algorithmica 7(1–6), 433–464 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Italian Association for Informatics and Automatic Calculus (AICA), Milano, Italy

    Gabriele Farina & Luigi Laura

  2. Polytechnic University of Milan, Milano, Italy

    Gabriele Farina

  3. “Sapienza” Università di Roma, Rome, Italy

    Luigi Laura

Authors
  1. Gabriele Farina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luigi Laura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luigi Laura .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Verona, Verona, Italy

    Zsuzsanna Lipták

  2. Dept. of Computing and Software, McMaster University, Hamilton, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Farina, G., Laura, L. (2016). Dynamic Subtrees Queries Revisited: The Depth First Tour Tree. In: Lipták, Z., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2015. Lecture Notes in Computer Science(), vol 9538. Springer, Cham. https://doi.org/10.1007/978-3-319-29516-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29516-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29515-2

  • Online ISBN: 978-3-319-29516-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation