Cut structures and randomized algorithms in edge-connectivity problems

Author(s)
Benczúr, András A
Thumbnail
DownloadFull printable version (16.21Mb)
Advisor
Michel X. Goemans.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.
 
Includes bibliographical references (leaves 195-202
 
Date issued
1997
URI
http://hdl.handle.net/1721.1/10533
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Massachusetts Institute of Technology
Keywords
Mathematics
Collections