dc.contributor | Hao, Jianxiu. | en_US |
dc.contributor | Orlin, James B., 1953-. | en_US |
dc.contributor | Sloan School of Management. | en_US |
dc.date.accessioned | 2003-04-29T05:06:07Z | |
dc.date.available | 2003-04-29T05:06:07Z | |
dc.date.issued | 1992 | en_US |
dc.identifier.other | WP #3372-92 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/2385 | |
dc.description | "December, 1992." | en_US |
dc.description | Includes bibliographical references (p. 25-26). | en_US |
dc.description.statementofresponsibility | Jianxiu Hao and James B. Orlin. | en_US |
dc.format.extent | 26 p. | en_US |
dc.format.extent | 2084666 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en_US |
dc.publisher | Sloan School of Management, Massachusetts Institute of Technology | en_US |
dc.relation.ispartofseries | Working paper (Sloan School of Management) ; 3372-92. | en_US |
dc.subject.lcc | HD28 .M414 no.3372-, 92 | en_US |
dc.title | A faster algorithm for finding the minimum cut in a graph | en_US |