Return to search

Cut structures and randomized algorithms in edge-connectivity problems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997. / Includes bibliographical references (leaves 195-202 / by András A. Benczúr. / Ph.D.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/10533
Date January 1997
CreatorsBenczúr, András A
ContributorsMichel X. Goemans., Massachusetts Institute of Technology. Dept. of Mathematics
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format202 leaves, 17001031 bytes, 17000789 bytes, application/pdf, application/pdf, application/pdf
RightsM.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

Page generated in 0.002 seconds