A Study of the Maximum Clique Problem on GPU Computing
碩士 === 國立臺灣科技大學 === 電子工程系 === 107 === Maximum Clique Problem (MCP) is a method for solving the maximum clique which can be used to find the maximum complete subgraph in a graph and the total number of points contained in this maximum clique. In Graph Theory it is a NP hard problem with the applicati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/pfhmau |