MCE-P:Scalable Maximum Clique Enumeration Using Apache Hama
碩士 === 國立臺灣科技大學 === 資訊工程系 === 104 === The maximum clique mining problem for extremely large graphs has been used in many fields, such as social network, bioinformatics and computational chemistry. Recently, some studies in the literature solve the problem using conventional MapReduce algorithms. Nev...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00189756932319713552 |