BiFennel: Fast Bipartite Graph Partitioning Algorithm for Big Data
碩士 === 國立清華大學 === 資訊系統與應用研究所 === 103 === Cloud computing is widely utilized in today’s internet service, which severely requires the ability of processing graphs of billion vertices rapidly in the situation such as social network analyze, bio-informational network analyze and semantic processing. Th...
Main Authors: | Wang, Lyu Wei, 王閭威 |
---|---|
Other Authors: | Yeh Ching, Chung |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/wu5heb |
Similar Items
-
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
by: A. I. Antonov, et al.
Published: (2015-03-01) -
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
by: A. I. Antonov, et al.
Published: (2012-01-01) -
Algorithmic aspects of bipartite graphs
by: Mihály Bakonyi, et al.
Published: (1995-01-01) -
Overlapping Community Detecting Based on Complete Bipartite Graphs in Micro-Bipartite Network Bi-Egonet
by: Furong Chang, et al.
Published: (2019-01-01) -
Graph Bipartition on Hypercube by Simulated Annealing
by: Chen, Wei-Yu, et al.
Published: (1993)