Advanced Search
DSpace@MIT

A faster algorithm for finding the minimum cut in a graph

Research and Teaching Output of the MIT Community

A faster algorithm for finding the minimum cut in a graph

Download
Author: Hao, Jianxiu.; Orlin, James B., 1953-.; Sloan School of Management.
Publisher: Sloan School of Management, Massachusetts Institute of Technology
Date Issued: 1992
Description:
"December, 1992."Includes bibliographical references (p. 25-26).
URI: http://hdl.handle.net/1721.1/2385
Other Identifiers: WP #3372-92
Series/Report no.: Working paper (Sloan School of Management) ; 3372-92.
Keywords: HD28 .M414 no.3372-, 92

Show full item metadata

Files in this item

Name Size Format Description
SWP-3372-25782065.pdf 1.988Mb PDF

This item appears in the following Collection(s)

MIT-Mirage