An inverse-ackermann type lower bound for online minimum spanning tree verification

Combinatorica

Volumn 26, Issue 2, 2006, Pages 207-230

  Pettie, Seth ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749331859     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-006-0014-1     Document Type: Article

References (40)

1. W. ACKERMANN: Zum Hilbertshen Aufbau der reelen Zahlen, Math. Ann. 99 (1928), 118-133.
2. P. K. AGARWAL and J. ERIKSON: Geometric range searching and its relatives, Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, R. Pollack, eds.); Contemporary Mathematics 223 (1998), 1-56.
3. A. AGGARWAL, M. KLAWE, S. MORAN, P. SHOR and R. WILBER: Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987), 195-208.
4. A. ALON and B. SCHIEBER.: Optimal preprocessing for answering on-line product queries, Technical Report TR-71/87, Institute of Computer Science, Tel Aviv University, 1987.
5. C. F. BAZLAMAÇCI and K. S. HINDI: Verifying minimum spanning trees in linear time, in Proc. Symp. on Operations Research (SOR), pages 139-144, 1997.
6. M. A. BENDER and M. FARACH-COLTON: The LCA problem revisited, in Proceedings 4th Latin American Symp. on Theoretical Informatics (LATIN), LNCS Vol. 1776, pages 88-94, 2000.
7. A. L. BUCHSBAUM, H. KAPLAN, A. ROGERS and J. R. WESTBROOK: Linear-time pointer-machine algorithms for LCAs, MST verification, and dominators; in Proc. 30th ACM Symposium on Theory of Computing (STOC'98), pages 279-288, May 23-26 1998.
8. B. CHAZELLE: Computing on a free tree via complexity-preserving mappings, Algorithmica 2(3) (1987), 337-361.
9. B. CHAZELLE: A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM 47(6) (2000), 1028-1047.
10. B. CHAZELLE: The soft heap: an approximate priority queue with optimal error rate, J. ACM 47(6) (2000), 1012-1027.
11. B. CHAZELLE and B. ROSENBERG: The complexity of computing partial sums offline, Internat. J. Comput. Geom. Appl. 1(1) (1991), 33-45.
12. T. H. CORMEN, C. E. LEISERSON and R. L. RIVEST: Introduction to Algorithms, MIT Press, Cambridge, Mass., 1990.
13. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST and C. STEIN: Introduction to Algorithms, MIT Press, 2001.
14. B. DIXON, M. RAUCH and R. E. TARJAN: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput. 21(6) (1992), 1184-1192.
15. M. L. FREDMAN and M. SAKS: The cell probe complexity of dynamic data structures, in Proc. 21st annual ACM Symposium on Theory of Computing, pages 345-354, 1989.
16. H. N. GABOW: A scaling algorithm for weighted matching on general graphs, in Proc. 26th Annual Symposium on Foundations of Computer Science (FOCS'85), pages 90-100, 1985.
17. H. N. GABOW, J. L. BENTLEY and R. E. TARJAN: Scaling and related techniques for geometry problems, in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 135-143, 1984.
18. W. GODDARD, C. KENYON, V. KING and L. SCHULMAN: Optimal randomized algorithms for local sorting and set-maxima, SIAM J. Comput. 22(2) (1993), 272-283.
19. T. HAGERUP: Improved shortest paths on the word RAM, in Proc. 27th Int'l Colloq. on Automata, Languages, and Programming (ICALP), LNCS vol. 1853, pages 61-72, 2000.
20. D. HAREL and R. E. TARJAN: Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13(2) (1984), 338-355.
21. S. HART and M. SHARIR: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6(2) (1986), 151-177.
22. D. R. KARGER, P. N. KLEIN and R. E. TARJAN: A randomized linear-time algorithm for finding minimum spanning trees, J. ACM 42 (1995), 321-329.
23. V. KING: A simpler minimum spanning tree verification algorithm, Algorithmica 18(2) (1997), 263-270.
24. M. M. KLAWE: Superlinear bounds on matrix searching, in Proc. 1st Annual ACMSIAM Symposium on Discrete Algonthms (SODA '90), pages 485-493, 1990.
25. M. M. KLAWE and D. J. KLEITMAN: An almost linear time algorithm for generalized matrix searching, SIAM J. Discr. Math. 3(1) (1990), 81-97.
26. J. KOMLÓS: Linear verification for spanning trees, Combinatorica 5(1) (1985), 57-65.
27. S. PETTIE: On the comparison-addition complexity of all-pairs shortest paths, in Proc 13th Int'l Symp. on Algonthms and Computation (ISAAC'02), pages 32-43, 2002.
28. S. PETTIE: On the shortest path and minimum spanning tree problems (Ph.D. Thesis), Technical Report TR-03-35, The University of Texas at Austin, Department of Computer Sciences, August 2003.
29. S. PETTIE: A new approach to all-pairs shortest paths on real-weighted graphs, Theor. Comp. Sci. 312(1) (2004), 47-74.
30. Special issue of selected papers from 29th lnt'l Colloq. on Automata Languages and Programming (ICALP 2002).
31. S. PETTIE and V. RAMACHANDRAN: A shortest path algorithm for real-weighted undirected graphs, SIAM J. Comput., to appear.
32. S. PETTIE and V. RAMACHANDRAN: Minimizing randomness in minimum spanning tree, parallel connectivity and set maxima algorithms, in Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA '02), pages 713-722, 2002.
33. S. PETTIE and V. RAMACHANDRAN: An optimal minimum spanning tree algorithm, J. ACM 49(1) (2002), 16-34.
34. R. E. TARJAN: Efficiency of a good but not linear set merging algorithm, J. ACM 22 (1975), 215-225.
35. R. E. TARJAN: Complexity of monotone networks for computing conjunctions, Ann. Discrete Math. 2 (1978), 121-133.
36. R. E. TARJAN: Applications of path compression on balanced trees, J. ACM 26(4) (1979), 690-715.
37. R. E. TARJAN: A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. Syst. Sci. 18(2) (1979), 110-127.
38. R. E. TARJAN: Sensitivity analysis of minimum spanning trees and shortest path problems (see also corrigendum IPL 23(4), p. 219); Info. Proc. Lett. 14(1) (1982), 30-33.
39. M. THORUP: Undirected single-source shortest paths with positive integer weights in linear time, J. ACM 46(3) (1999), 362-394.
40. A. C. YAO: Space-time tradeoff for answering range queries, in Proc. 14th ACM Symposium on Theory of Computing (STOC'82), pages 128-136, 1982.