On a Biclique Structure of Biconvex Bipartite Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 91 === A bipartite graph G = (X, Y,E) is biconvex if both X and Y can be ordered so that for every vertex v in X ∪ Y , vertices in N(v) occur consecutively in the ordering. In this thesis, we define the interval representation on biconvex bipartite graphs. By the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93778774198190497263 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 91 ===
A bipartite graph G = (X, Y,E) is biconvex if both X and Y can be ordered so that
for every vertex v in X ∪ Y , vertices in N(v) occur consecutively in the ordering. In
this thesis, we define the interval representation on biconvex bipartite graphs. By the
interval representation, we propose a trapezoid decomposition for biconvex bipartite
graphs. We show that the trapezoid decomposition represent a biclique structure
of a biconvex bipartite graph. Using this decomposition, the minimum fill-in and
treewidth problems can be solved in a unified approach on biconvex bipartite graphs.
|
|---|