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: | Li-How Liau, 廖利豪 |
---|---|
Other Authors: | Sheng-lung Peng |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93778774198190497263 |
Similar Items
-
Biclique: an R package for maximal biclique enumeration in bipartite graphs
by: Yuping Lu, et al.
Published: (2020-02-01) -
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
by: Yi-Chuan Yang, et al.
Published: (2003) -
Finding maximal bicliques in bipartite networks using node similarity
by: Taher Alzahrani, et al.
Published: (2019-05-01) -
A Biconvex Form for Copulas
by: Fuchs Sebastian
Published: (2016-02-01) -
The Bipartite-Splittance of a Bipartite Graph
by: Yin Jian-Hua, et al.
Published: (2019-02-01)