Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2385| Title: | A faster algorithm for finding the minimum cut in a graph |
| Authors: | Hao, Jianxiu. Orlin, James B., 1953-. Sloan School of Management. |
| Keywords: | HD28 .M414 no.3372-, 92 |
| Issue Date: | 1-Jun-2013 |
| Publisher: | Sloan School of Management, Massachusetts Institute of Technology |
| Description: | Jianxiu Hao and James B. Orlin. "December, 1992." Includes bibliographical references (p. 25-26). |
| URI: | http://koha.mediu.edu.my:8181/jspui/handle/1721 |
| Other Identifiers: | WP #3372-92 http://hdl.handle.net/1721.1/2385 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.