Using randomized sparsification to approximate minimum cuts
David R. Karger
Proc. 5th Symp. Discrete Algorithms
,
ACM
and
SIAM
,
Jan 1994, pp. 424–432
Cites:
Sparsification — A technique for speeding up dynamic graph algorithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
