Levine, M. S., & Karger, D. R. (2005). Algorithms for connectivity problems in undirected graphs: Maximum flow and minimun [kappa]-way cut. Massachusetts Institute of Technology.
Chicago Style (17th ed.) CitationLevine, Matthew S., and David R. Karger. Algorithms for Connectivity Problems in Undirected Graphs: Maximum Flow and Minimun [kappa]-way Cut. Massachusetts Institute of Technology, 2005.
MLA (9th ed.) CitationLevine, Matthew S., and David R. Karger. Algorithms for Connectivity Problems in Undirected Graphs: Maximum Flow and Minimun [kappa]-way Cut. Massachusetts Institute of Technology, 2005.
Warning: These citations may not always be 100% accurate.