Random Sampling in Graph Optimization Problems

David R. Karger
Ph.D. thesis, Stanford Univ., Computer Science Dept., Feb 1995
Tech. report CS-TR-95-1541, Stanford Univ., Computer Science Dept., Feb 1995
http://elib.stanford.edu/Dienst/UI/2.0/Describe/stanford.cs/CS-TR-95-1541

Cites:

• Sparsification — A technique for speeding up dynamic graph algorithms