Finding k-cliques on a k-partite Graph
碩士 === 國立東華大學 === 資訊工程學系 === 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 i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/49842790430568492699 |