Show simple item record

dc.contributorHao, Jianxiu.en_US
dc.contributorOrlin, James B., 1953-.en_US
dc.contributorSloan School of Management.en_US
dc.date.accessioned2003-04-29T05:06:07Z
dc.date.available2003-04-29T05:06:07Z
dc.date.issued1992en_US
dc.identifier.otherWP #3372-92en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/2385
dc.description"December, 1992."en_US
dc.descriptionIncludes bibliographical references (p. 25-26).en_US
dc.description.statementofresponsibilityJianxiu Hao and James B. Orlin.en_US
dc.format.extent26 p.en_US
dc.format.extent2084666 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherSloan School of Management, Massachusetts Institute of Technologyen_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 3372-92.en_US
dc.subject.lccHD28 .M414 no.3372-, 92en_US
dc.titleA faster algorithm for finding the minimum cut in a graphen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record