Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 964-973

  Pettie, Seth ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE-ACKERMANN FUNCTION; SPANNING TREE; WEIGHTED ELEMENTS;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FUNCTION EVALUATION; INVERSE PROBLEMS; SENSITIVITY ANALYSIS;

TREES (MATHEMATICS);

EID: 33744950986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_96     Document Type: Conference Paper

References (33)

1. 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.
2. 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.
3. 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), pages 279-288, 1998.
4. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2(3):337-361, 1987.
5. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM, 47(6):1028-1047, 2000.
6. B. Chazelle. The soft heap: an approximate priority queue with optimal error rate. J. ACM, 47(6):1012-1027, 2000.
7. B. Dixon, M. Rauch, and R. E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput., 21(6):1184-1192, 1992.
8. M. L. Fredman and M. Saks. The cell probe complexity of dynamic data structures; In Proc. 21st ACM Symposium on Theory of Computing, pages 345-354, 1989.
9. H. N. Gabow. A scaling algorithm for weighted matching on general graphs. In Proc. 26th Symp. on Foundations of Computer Science (FOCS), pages 90-100; 1985.
10. 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.
11. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci., 30(2):209-221, 1985.
12. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graph-matching problems. J. ACM, 38(4):815-853, 1991.
13. W. Goddard, C. Kenyon, V. King, and L. Schulman. Optimal randomized algorithms for local sorting and set-maxima. SIAM J. Comput., 22(2):272-283, 1993.
14. R. L. Graham and P. Hell. On the history of the minimum spanning tree problem. Ann. Hist. Comput., 7(1):43-57, 1985.
15. 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.
16. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees. J. ACM, 42:321-329, 1995.
17. I. Katriel, P. Sanders, and J. L. Träff. A practical minimum spanning tree algorithm using the cycle property. In Proc. 11th Annual European Symposium on Algorithms, LNCS Vol. 2832, pages 679-690, 2003.
18. V. King. A simpler minimum spanning tree verification algorithm. Algorithmica, 18(2):263-270, 1997.
19. J. Komlós. Linear verification for spanning trees. Combinatorica, 5(1):57-65, 1985.
20. H. LaPoutré. Lower bounds for the union-find and the split-find problem on pointer machines. J. Comput. Syst. Sci., 52:87-99, 1996.
21. S. Pettie. An inverse-Ackermann type lower bound for online minimum spanning tree verification. Combinatorica. to appear.
22. S. Pettie. On the comparison-addition complexity of all-pairs shortest paths. In Proc. 13th Int'l Symp. Algorithms and Computation (ISAAC), pages 32-43, 2002.
23. S. Pettie. On the Shortest Path and Minimum Spanning Tree Problems. Ph.D. thesis, The University of Texas at Austin, 2003. Department of Computer Sciences Technical Report TR-03-35.
24. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312(1):47-74, 2004.
25. S. Pettie and V. Ramachandran. Minimizing randomness in minimum spanning tree, parallel connectivity and set maxima algorithms. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 713-722, 2002.
26. S. Pettie and V. Ramachandran. An optimal minimum spanning tree algorithm. J. ACM, 49(1):16-34, 2002.
27. S. Pettie and V. Ramachandran. New randomized minimum spanning tree algorithms using exponentially fewer random bits, manuscript, submitted, 2005.
28. S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput., 34(6):1398-1431, 2005.
29. R. E. Tarjan. Efficiency of a good but not linear set merging algorithm. J. ACM, 22:215-225, 1975.
30. R. E. Tarjan. Applications of path compression on balanced trees. J. ACM, 26(4):690-715, 1979.
31. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci., 18(2):110-127, 1979.
32. R. E. Tarjan. Sensitivity analysis of minimum spanning trees and shortest path problems. Info. Proc. Lett., 14(1):30-33, 1982. See Corrigendum, IPL 23(4):219.
33. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999.