On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 91 === A triangulation of a graph G is a chordal graph which contains G as a subgraph. For a given graph G, the treewidth problem is to find a triangulation of G such that its maximal clique size is smallest. Similarly, the pathwidth problem is to find a triangulatio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51295934815489826331 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 91 ===
A triangulation of a graph G is a chordal graph which contains G as a subgraph. For a given graph G, the treewidth problem is to find a triangulation of G such that its maximal clique size is smallest. Similarly, the pathwidth problem is to find a triangulation of G such that the maximal clique size is smallest and the triangulated graph is an interval graph.
For chordal bipartite graphs, Kloks and Kratsch proposed an O(m3)—time algorithm to compute the treewidth problem and Bodlaender et al. proved that the pathwidth problem is NP-complete. In this thesis, we propose O(n2) algorithms to solve the treewidth and pathwidth problems on biconvex bipartite graphs.
|
|---|