2026-09-20T07:02:37Zhttps://repository.rice.edu/server/oai/request

oai:repository.rice.edu:1911/185162024-01-11T20:57:43Zcom_1911_8299col_1911_13110

Dean, Nathaniel Cook, William J. Christian, William Anderson, Jr 2009-06-04T06:42:54Z 2009-06-04T06:42:54Z 2003 Christian, William Anderson, Jr. "Linear-time algorithms for graphs with bounded branchwidth." (2003) Diss., Rice University. <a href="https://hdl.handle.net/1911/18516">https://hdl.handle.net/1911/18516</a>. https://hdl.handle.net/1911/18516 THESIS MATH.SCI. 2003 CHRISTIAN We present an algorithmic framework (including a single data structure) that is extended into linear-time algorithms to solve several NP-complete graph problems (i.e., INDEPENDENT SET, M AXIMUM CUT, GRAPH COLORING, HAMILTONIAN CYCLE, and DISJOINT PATHS). The linearity is achieved assuming the provision of a branch decomposition of the instance graph. We then modify the framework to create a multithreaded framework that uses the existing problem-specific extensions without any revision. Computational results for the serial and parallel algorithms are provided. In addition, we present a graphical package called JPAD that can display a graph and branch decomposition, show their relationship to each other, and be extended to rim and display the progress and results of algorithms on graphs or on branch decompositions. 108 p. application/pdf eng Copyright 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. Mathematics Industrial engineering Computer science Linear-time algorithms for graphs with bounded branchwidth Thesis Text Mathematical Sciences Engineering Rice University Doctoral Doctor of Philosophy open.access