- 期刊
ALGORITHMIC ASPECTS OF BIPARTITE GRAPHS
摘要
We generalize previous work done by Donald J. Rose and Robert E. Tarjan, who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.
延伸閱讀
- 林泰平（2006）。The study of C4-saturated bipartite graphs〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2006.00629
- Wen, T. K. (2010). On The Domatic Number of Bipartite Permutation Graphs [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0211201015593075
- Ke, C. C., & Yang, C. L. (2010). Algorithms on Generating Regular Graphs. 明道學術論壇, 6(1), 3-17. https://doi.org/10.6953/MJ.201003.0002
- Wei, W. L. (2015). BiFennel: Fast Bipartite Graph Partitioning Algorithm for Big Data [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0312201510303989
- Cheng, Y. J. (2018). Spectral Radius of a Bipartite Graph [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0030-0205201911082194