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 |