New algorithms for pathwidth computation

Simple item page
dc.contributor.advisorDean, Nathanielen_US
dc.creatorLi, Mingen_US
dc.date.accessioned2009-06-04T08:43:01Zen_US
dc.date.available2009-06-04T08:43:01Zen_US
dc.date.issued2004en_US
dc.description.abstractThe notions of pathwidth and the closely related treewidth have become more and more important recently. The importance lies not only in theory but also in practice. Theoretically, lots of NP-hard problems become polynomially solvable when restricted in graphs with bounded pathwidth (or treewidth). Practically, pathwidth and treewidth have significant applications in many different fields such as searching games, VLSI design, matrix computation, etc. Computing pathwidth is an NP-complete problem for general graphs, but polynomially solvable for treewidth-bounded graphs. However, there is no known practical algorithm to compute pathwidth for treewidth-bounded graphs. In this dissertation, a new algorithm for computing pathwidth and finding an optimal pathwidth-decomposition for treewidth-bounded graph is presented. This algorithm uses an interval completion technique and the branch-and-bound method to make the pathwidth computation process more efficient, practical, and easy to implement. It can also be easily converted to a parallel algorithm. The data structure for implementing this algorithm is presented, and some computational results are shown. Some heuristic methods to approximate pathwidth for general graphs are also given, especially for series-parallel graphs.en_US
dc.format.extent104 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS MATH.SCI. 2004 LIen_US
dc.identifier.citationLi, Ming. "New algorithms for pathwidth computation." (2004) Diss., Rice University. <a href="https://hdl.handle.net/1911/18662">https://hdl.handle.net/1911/18662</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/18662en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectOperations researchen_US
dc.titleNew algorithms for pathwidth computationen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentMathematical Sciencesen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
3122503.PDF
Size:
3.07 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations