The complexity of constructing evolutionary trees using experiments (2001)

by Gerth Stølting Brodal , Rolf Fagerberg , Christian N. S. Pedersen , Anna Östlin
Citations:8 - 1 self

Active Bibliography

5 Design and Analysis of Data Structures for Dynamic Trees – Renato F. Werneck - 2006
12 Maintaining information in fully-dynamic trees with top trees – Stephen Alstrup, Jacob Holm, Kristian Lichtenberg, Mikkel Thorup - 2003
17 Maintaining Center and Median in Dynamic Trees – Stephen Alstrup, Jacob Holm, Mikkel Thorup - 2000
13 Fully-dynamic min-cut – Mikkel Thorup - 2007
3 Top-Trees and Dynamic Graph Algorithms – Jacob Holm, Kristian de Lichtenberg - 1998
12 Unique Maximum Matching Algorithms – Harold N. Gabow, Haim Kaplan, Robert E. Tarjan - 2002
6 Finding Cores of Limited Length – Stephen Alstrup, Peter W. Lauridsen, Peter Sommerlund, Mikkel Thorup - 2001
2 Combine and Conquer – Robert F. Cohen, Robert F. Cohen, Roberto Tamassia, Roberto Tamassia - 1992
5 Dynamic Trees in Practice ⋆ – Robert E. Tarjan, Renato F. Werneck
125 Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree – Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup - 1997
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
4 Improved Data Structures for Fully Dynamic Biconnectivity – Monika Rauch Henzinger - 1997
16 Improved Algorithms for Finding Level Ancestors in Dynamic Trees – Stephen Alstrup, Jacob Holm - 2000
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
1 Data Structures – Roberto Tamassia - 1996
Maintaining Centdians in a Fully Dynamic Forest – Hung-lung Wang
17 Dynamic parallel tree contraction – John H. Reif, Stephen R. Tate - 1994
21 An Experimental Analysis of Change Propagation in Dynamic Trees – Umut A. Acar, Guy E. Blelloch, Jorge L. VIttes - 2005
786 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994