A Study on the Problem of Maximal Clique Enumeration on GPU
碩士 === 國立臺灣科技大學 === 電子工程系 === 105 === Maximal Clique Enumeration is a graph theory problem, which can find all complete subgraphs in a graph, is suitable for graph analysis such as network structure, graph clustering and community group detection, etc. Bron-Kerbosch algorithm is the most popular alg...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/9374y3 |