We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A faster algorithm for finding the minimum cut in a graph

Thumbnail Image
Download
Name

SWP-3372-25782065.pdf

Size

1.99 MB

Format

Adobe PDF

Checksum (MD5)

98ed9bdb94eedfdc4e08a4e6e976e766

Date Issued
1992
Publisher
Sloan School of Management, Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 3372-92.
Description
"December, 1992."
Includes bibliographical references (p. 25-26).
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.