Show simple item record

dc.contributor.authorMehrotra, Anujen_US
dc.date.accessioned2008-08-21T11:31:21Z
dc.date.available2008-08-21T11:31:21Z
dc.date.issued1992-12en_US
dc.identifier.urihttp://hdl.handle.net/1853/24234
dc.publisherGeorgia Institute of Technologyen_US
dc.rightsAccess restricted to authorized Georgia Tech users only.en_US
dc.subject.lcshGraph theoryen_US
dc.subject.lcshAlgorithmsen_US
dc.titleConstrained graph partitioning : decomposition, polyhedral structure and algorithmsen_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentIndustrial engineeringen_US
dc.description.advisorGeorge L. Nemhauseren_US
dc.identifier.bibid364347en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record