Multiple Trajectory Search for the Maximum Clique Problem
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 97 === The Multiple Trajectory Search (MTS) for solving the maximum clique problem is proposed in this thesis. The maximum clique problem is a famous NP-hard problem in the graph theory and has attracted much attention of researches for a very long period. Since this...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64619959107701982376 |