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 |
id |
ndltd-TW-091NDHU5392012 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091NDHU53920122016-06-22T04:20:04Z http://ndltd.ncl.edu.tw/handle/51295934815489826331 On the Treewidth and Pathwidth of Biconvex Bipartite Graphs 雙凸二分圖上的樹寬和徑寬問題 Yi-Chuan Yang 楊益全 碩士 國立東華大學 資訊工程學系 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. Sheng-Lung Peng 彭勝龍 2003 學位論文 ; thesis 54 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 資訊工程學系 === 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.
|
author2 |
Sheng-Lung Peng |
author_facet |
Sheng-Lung Peng Yi-Chuan Yang 楊益全 |
author |
Yi-Chuan Yang 楊益全 |
spellingShingle |
Yi-Chuan Yang 楊益全 On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
author_sort |
Yi-Chuan Yang |
title |
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
title_short |
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
title_full |
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
title_fullStr |
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
title_full_unstemmed |
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs |
title_sort |
on the treewidth and pathwidth of biconvex bipartite graphs |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/51295934815489826331 |
work_keys_str_mv |
AT yichuanyang onthetreewidthandpathwidthofbiconvexbipartitegraphs AT yángyìquán onthetreewidthandpathwidthofbiconvexbipartitegraphs AT yichuanyang shuāngtūèrfēntúshàngdeshùkuānhéjìngkuānwèntí AT yángyìquán shuāngtūèrfēntúshàngdeshùkuānhéjìngkuānwèntí |
_version_ |
1718316902278758400 |