https://scholars.lib.ntu.edu.tw/handle/123456789/488306
標題: | Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model. | 作者: | Sheu, Jang-Ping Kuo, Nan-Ling GEN-HUEY CHEN |
關鍵字: | bipartite graph; breadth-first search; depth-first search; hypercube; Maximum matching; parallel algorithm | 公開日期: | 1990 | 卷: | 13 | 期: | 2 | 起(迄)頁: | 245-251 | 來源出版物: | Parallel Computing | 摘要: | In this paper, we propose parallel algorithms for breadth-first search and depth-first search on the hypercube network model. In addition, a parallel algorithm based on the same model for finding maximum matching in bipartite graphs is proposed. © 1990. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0025385526&doi=10.1016%2f0167-8191%2890%2990151-X&partnerID=40&md5=8836082bcbbda901476015ce3de20fdf | DOI: | 10.1016/0167-8191(90)90151-X | SDG/關鍵字: | Computer Programming--Algorithms; Mathematical Techniques--Graph Theory; Breadth-First Search; Maximum Matching; Parallel Algorithms; Computer Systems, Digital |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。