Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Sloan School of Management
  3. Sloan Working Papers
  4. A faster algorithm for finding the minimum cut in a graph

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
http://hdl.handle.net/1721.1/2385
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.