Show simple item record

dc.contributor.authorLevinton, Ira Rayen_US
dc.date.accessioned2016-02-01T14:45:18Z
dc.date.available2016-02-01T14:45:18Z
dc.date.issued1978en_US
dc.identifier.urihttp://hdl.handle.net/10919/64663
dc.format.extent147 leavesen_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.publisherVirginia Polytechnic Institute and State Universityen_US
dc.rightsThis Item is protected by copyright and/or related rights. Some uses of this Item may be deemed fair and permitted by law even without permission from the rights holder(s), or the rights holder(s) may have licensed the work for use under certain conditions. For other uses you need to obtain permission from the rights holder(s).en_US
dc.subject.lccLD5655.V855 1978.L49en_US
dc.subject.lcshHamiltonian systemsen_US
dc.subject.lcshGraph theoryen_US
dc.titleA decomposition procedure for finding the minimal Hamiltonian chain of a sparse graphen_US
dc.typeThesisen_US
dc.contributor.departmentIndustrial Engineering and Operations Researchen_US
dc.description.degreeM.S.en_US
dc.identifier.oclc20742204en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
dc.type.dcmitypeTexten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record