A faster algorithm for finding the minimum cut in a graph
"December, 1992."
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Sloan School of Management, Massachusetts Institute of Technology
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2385 |
| _version_ | 1826200127239356416 |
|---|---|
| author2 | Hao, Jianxiu. |
| author_facet | Hao, Jianxiu. |
| collection | MIT |
| description | "December, 1992." |
| first_indexed | 2024-09-23T11:31:37Z |
| id | mit-1721.1/2385 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:31:37Z |
| publishDate | 2003 |
| publisher | Sloan School of Management, Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/23852019-04-12T08:21:45Z A faster algorithm for finding the minimum cut in a graph Hao, Jianxiu. Orlin, James B., 1953-. Sloan School of Management. HD28 .M414 no.3372-, 92 "December, 1992." Includes bibliographical references (p. 25-26). Jianxiu Hao and James B. Orlin. 2003-04-29T05:06:07Z 2003-04-29T05:06:07Z 1992 WP #3372-92 http://hdl.handle.net/1721.1/2385 eng Working paper (Sloan School of Management) ; 3372-92. 26 p. 2084666 bytes application/pdf application/pdf Sloan School of Management, Massachusetts Institute of Technology |
| spellingShingle | HD28 .M414 no.3372-, 92 A faster algorithm for finding the minimum cut in a graph |
| title | A faster algorithm for finding the minimum cut in a graph |
| title_full | A faster algorithm for finding the minimum cut in a graph |
| title_fullStr | A faster algorithm for finding the minimum cut in a graph |
| title_full_unstemmed | A faster algorithm for finding the minimum cut in a graph |
| title_short | A faster algorithm for finding the minimum cut in a graph |
| title_sort | faster algorithm for finding the minimum cut in a graph |
| topic | HD28 .M414 no.3372-, 92 |
| url | http://hdl.handle.net/1721.1/2385 |