Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 484-538

  Frederickson, Greg N ^a  

^a Purdue University   (United States)

Author keywords

2 edge connectivity; Analysis of algorithms; Data structures; Embedded planar graph; Fully persistent data structures; k smallest spanning trees; Minimum spanning tree; On line updating; Topology tree

Indexed keywords

EID: 0000914873     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792226825     Document Type: Article

References (32)

1. K. ABRAHAMSON, N. DADOUN, D. G. KIRKPATRICK, AND T. PRZYTYCKA, A simple parallel tree contraction algorithm, J. Algorithms, 10 (1989), pp. 287-302.
2. M. BLUM, R. W. FLOYD, V. R. PRATT, R. L. RIVEST, AND R. E. TARJAN, Time bounds for selection, J. Comput. System Sci., 7 (1972), pp. 448-461.
3. H. BOOTH AND J. WESTBROOK, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Algorithmica, 11 (1994), pp. 341-352.
4. R. N. BURNS AND C. E. HAFF, A ranking problem in graphs, in Proc. 5th Southeast Conference on Combinatorics, Graph Theory and Computing 19, Utilitas Mathematica Publishing, Winnepeg, MB, Canada, 1974, pp. 461-470.
5. P. M. CAMERINI, L. FRATTA, AND F. MAFFIOLI, The k shortest spanning trees of a graph, Technical Report Int. Rep. 73-10, IEE-LCE Politecnico di Milano, Milan, Italy, 1974.
6. D. CHERITON AND R. E. TARJAN, Finding minimum spanning trees, SIAM J. Comput., 5 (1976), pp. 310-313.
7. R. COLE AND U. VISHKIN, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Algorithmica, 3 (1988), pp. 329-346.
8. J. DRISCOLL, N. SARNAK, D. SLEATOR, AND R. TARJAN, Making data structures persistent, J. Comput. System Sci., 38 (1989), pp. 86-124.
9. D. EPPSTEIN, Finding the k smallest spanning trees, BIT, 32 (1992), pp. 237-248.
10. D. EPPSTEIN, Z. GALIL, AND G. F. ITALIANO, Improved sparsification, Technical Report 93-20, Department of Information and Computer Science, University of California at Irvine, Irvine, CA, 1993.
11. D. EPPSTEIN, Z. GALIL, G. F. ITALIANO, AND A. NISSENZWEIG, Sparsification: A technique for speeding up dynamic graph algorithms, in Proc. 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 60-69.
12. G. N. FREDERICKSON, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput., 14 (1985), pp. 781-798.
13. G. N. FREDERICKSON, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. in Proc. 32nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 632-641.
14. G. N. FREDERICKSON, A data structure for dynamically maintaining rooted trees, in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1993, pp. 175-184.
15. G. N. FREDERICKSON, An optimal algorithm for selection in a min-heap, Inform. and Comput., 104 (1993), pp. 197-214.
16. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach., 34 (1987), pp. 596-615.
17. H. N. GABOW, Two algorithms for generating weighted spanning trees in order, SIAM J. Comput., 6 (1977), pp. 139-150.
18. H. N. GABOW, Z. GALIL, T. H. SPENCER, AND R. E. TARJAN, Efficient algorithms for minimum spanning trees on directed and undirected graphs, Combinatorica, 6 (1986), pp. 109-122.
19. Z. GALIL AND G. F. ITALIANO, Fully dynamic algorithms for 2-edge-connectivity, SIAM J. Comput., 21 (1992), pp. 1047-1069.
20. F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1969.
21. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
22. D. HAREL, private communication, 1983.
23. N. KATOH, T. IBARAKI, AND H. MINE, An algorithm for finding k minimum spanning trees, SIAM J. on Comput., 10 (1981), pp. 247-255.
24. E. L. LAWLER, A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem, Management Sci., 18 (1972), pp. 401-405.
25. E. L. LAWLER, Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
26. G. L. MILLER AND J. H. REIF, Parallel tree contraction part I: Fundamentals, in Randomness and Computation, Vol. 5, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 47-72.
27. K. G. MURTY, An algorithm for ranking all the assignments in order of increasing cost, Oper. Res., 16 (1968), pp. 682-687.
28. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
29. R. E. TARJAN, Applications of path compression on balanced trees, J. Assoc. Comput. Mach., 26 (1979), pp. 690-715.
30. R. E. TARJAN, Sensitivity analysis of minimum spanning trees and shortest path trees, Inform. Process. Lett., 14 (1982), pp. 30-33.
31. J. WESTBROOK AND R. E. TARJAN, Maintaining bridge-connected and biconnected components on-line, Algorithmica, 7 (1992), pp. 433-464.
32. J. Y. YEN, Finding the k shortest loopless paths in a network, Management Sci., 17 (1971), pp. 712-716.