Show simple item record

dc.contributor.authorTan, Zhengen
dc.date.accessioned2015-05-12T20:49:56Z
dc.date.available2015-05-12T20:49:56Z
dc.date.issued2000en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/8017en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshBranch and bound algorithmsen
dc.subject.lcshGraph theoryen
dc.titleA branch-and-bound algorithm for the crossing number of a graphen
dc.typeThesisen
dc.rights.holderCopyright 2000 by Zheng Tanen
thesis.catalog.ckey804545en
thesis.degree.departmentComputer Science.en
thesis.degree.genreThesisen
thesis.degree.nameMSen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage41en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.