2026-09-20T05:00:43Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/105332022-01-13T07:54:34Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Michel X. Goemans.
Benczúr, András A
Massachusetts Institute of Technology. Department of Mathematics
2005-08-18T21:26:37Z
2005-08-18T21:26:37Z
1997
1997
http://hdl.handle.net/1721.1/10533
37923906
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.
202 leaves
17001031 bytes
17000789 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Mathematics
Cut structures and randomized algorithms in edge-connectivity problems
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7124849f-990e-4004-b9ab-7ed4bac18c8d">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Cut structures and randomized algorithms in edge-connectivity problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1997</PublicationDate>
<Authors>
<Author>
<DisplayName>Benczúr, András A</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics</Keyword>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>