- David R. Karger, Philip N. Klein, and Robert E. Tarjan. A randomized linear-time algorithm
to find minimum spanning trees. Journal of the ACM,
42(2):321-328, March 1995.
Abstract,
References,
Citations,
etc.
- David R. Karger and Clifford Stein. A new approach to the minimum cut
problem. Journal of the ACM, 43(4):601-640, July 1996.
Abstract,
References,
Citations,
etc.
- David Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by
semidefinite programming. Journal of the ACM,
45(2):246-265, March 1998.
References,
etc.
Shortcuts: