Computing the Maximum Clique Distance on a Large-Scale Network
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 99 === We study the clique diameter problem. Given an undirected, unweighted graph containing a set of cliques, we are interested in finding the maximum distance among all pairs of cliques. In the context of social network analysis, a clique represents an ideal commun...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/70994751016546503262 |