Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.

Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.

Bibliographic Details
Main Author: Levine, Matthew S. (Matthew Steven)
Other Authors: David R. Karger.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2005
Subjects:
Electrical Engineering and Computer Science.
Online Access:http://hdl.handle.net/1721.1/29234

Similar Items

Similar Items