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: | Yi-Chuan Yang, 楊益全 |
---|---|
Other Authors: | Sheng-Lung Peng |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51295934815489826331 |
Similar Items
-
On a Biclique Structure of Biconvex Bipartite Graphs
by: Li-How Liau, et al.
Published: (2003) -
A Unified Approach for Treewidth and Minimum Fill-in Problems on Bipartite Permutation Graphs
by: Jun-Rong Lin, et al.
Published: (2002) -
The Chordality and Treewidth of a Graph
by: 游朝凱 -
On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01) -
Treewidth of Graphs and Algorithmic Implications
by: Wallgren, Anton
Published: (2020)