A branch-and-bound algorithm for the crossing number of a graph

Simple item page
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/handle/1/8017en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.rights.holderCopyright 2000 by Zheng Tanen
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
thesis.catalog.ckey804545en
thesis.degree.departmentComputer Scienceen
thesis.degree.genreThesisen
thesis.degree.nameMSen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage41en

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
31762103384218.pdf
Size:
1.8 MB
Format:
Adobe Portable Document Format
Download

Collections

Theses and Dissertations at Montana State University (MSU)