Finding k-cliques on a k-partite Graph

• Main Authors: Jheng-Ming Yang, 楊正銘
• Other Authors: Sheng-Lung Peng
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/49842790430568492699

碩士 === 國立東華大學 === 資訊工程學系 === 93 === A k-partite graph is a graph whose vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent. Most of the cases in arbitrary graphs are dealing with maximum clique finding, instead of a k-partite graph. However, it is interesting that some problems may be reduced to the problem of finding k-cliques on k-partite graphs, such as textile industrial, computational biology, and graph coloring. In this thesis, we show that the hardness of finding a k-clique on a k-partite graph. Then we proposed an exact algorithm to find all k-cliques on a k-partite graph. The experimental results show that our algorithm runs better than previous one in most cases.