A faster algorithm for finding the minimum cut in a graph

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2385

Full metadata record

DC Field	Value	Language
dc.contributor	Hao, Jianxiu.	-
dc.contributor	Orlin, James B., 1953-.	-
dc.contributor	Sloan School of Management.	-
dc.date	2003-04-29T05:06:07Z	-
dc.date	2003-04-29T05:06:07Z	-
dc.date	1992	-
dc.date.accessioned	2013-06-01T00:58:29Z	-
dc.date.available	2013-06-01T00:58:29Z	-
dc.date.issued	2013-06-01	-
dc.identifier	WP #3372-92	-
dc.identifier	http://hdl.handle.net/1721.1/2385	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	Jianxiu Hao and James B. Orlin.	-
dc.description	"December, 1992."	-
dc.description	Includes bibliographical references (p. 25-26).	-
dc.format	26 p.	-
dc.format	2084666 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Sloan School of Management, Massachusetts Institute of Technology	-
dc.relation	Working paper (Sloan School of Management) ; 3372-92.	-
dc.subject	HD28 .M414 no.3372-, 92	-
dc.title	A faster algorithm for finding the minimum cut in a graph	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI