Sampling to provide or to bound: With applications to fully dynamic graph algorithms

Random Structures and Algorithms

Volumn 11, Issue 4, 1997, Pages 369-379

  Henzinger, Monika R ^a,b   Thorup, Mikkel ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040058197     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199712)11:4<369::AID-RSA5>3.0.CO;2-X     Document Type: Article

References (7)

1. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18, 155-193 (1979).
2. D. Eppstein, Z. Galil, and G. F. Italiano, Improved sparsification, Technical Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.
3. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, Proceedings 33rd Symposium on Foundations of Computer Science, 1992, pp. 60-69.
4. M. L. Fredman and M. R. Henzinger, Lower bounds for fully dynamic connectivity problems in graphs. To appear in Algorithmica.
5. G. N. Fredrickson, Data structures for on-line updating of minimum spanning trees, SIAM J. Comput. 14, 781-798 (1985).
6. M. R. Henzinger and V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation, Proceedings 27th ACM Symposium on Theory of Computing, 1995, pp. 519-527.
7. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia, Complexity models for incremental computation, Theoret. Comput. Sci., 130, 203-236 (1994).