Cut structures and randomized algorithms in edge-connectivity problems

Benczúr, András A

Cut structures and randomized algorithms in edge-connectivity problems

Download

Name

37923906-MIT.pdf

Description

Full printable version

Size

16.21 MB

Format

Adobe PDF

Checksum (MD5)

08866558fe521286cf42a7aec2cd698d

Author(s)

Benczúr, András A

Advisor(s)

Michel X. Goemans.

Date Issued

1997

Publisher

Massachusetts Institute of Technology

Description

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.

Includes bibliographical references (leaves 195-202

Subjects

Mathematics

MIT Department

Massachusetts Institute of Technology. Department of Mathematics

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

Persistent DSpace Link

http://hdl.handle.net/1721.1/10533