Improved sampling with applications to dynamic graph algorithms

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

Volumn 1099, Issue , 1996, Pages 290-299

  Henzinger, Monika Rauch ^a   Thorup, Mikkel ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

BIPARTITENESS; CONNECTIVITY PROBLEMS; DYNAMIC GRAPH ALGORITHMS; EXPECTED TIME; MINIMUM SPANNING TREES; RANDOMIZED ALGORITHMS; RUNNING TIME; SAMPLING LEMMA;

ALGORITHMS;

EID: 84947741639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (10)

1. N. Alon, J. Spencer, P. Erdös. The Probabilistic Method. Wiley-Inter science Series, Johan Wiley and Sons, Inc., 1992.
2. D. Angluin, L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sei. 18 (2), 1979, 155-193.
3. D. Eppstein, Ζ. Galil, G. F. Italiano. Improved Sparsification. Tech. Report 9320, Department of Information and Computer Science, University of California, Irvine, CA 92717.
4. D. Eppstein, Ζ. Galil, G. F. Italiano, A. Nissenzweig. Sparsification - A Technique for Speeding up Dynamic Graph Algorithms. Proc. 33rd Symp. on Foundations of Computer Science, 1992, 60-69.
5. M. L. Fredman and M. R. Henzinger. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Submitted to Algorithmica.
6. M. R. Henzinger and V. King. Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation. Proc. 27th ACM Symp. on Theory of Computing, 1995, 519-527.
7. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. EATGS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.
8. P.B. Miltersen, S. Subramanian, J.S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130, 1994, 203236.
9. J. P. Schmidt, A. Siegel, A. Srinivasan. Chernoff-Hoeffding Bounds for Limited Independence. SIAM J. on Discrete Mathematics 8 (2), 1995, 223-250.
10. R.E. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. SIAM J. Computing, 14(4): 862-874, 1985.