Finding Maximal Quasi-Cliques for a Target Vertex in a Graph
碩士 === 國立清華大學 === 資訊工程學系 === 102 === In real world, many applications such as social networks and biological networks can be modeled as graphs. Discovering dense sub-graphs from these graphs is an interesting study. Quasi-cliques are a type of dense graphs, which are close to the complete graphs. In...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/44222007862939638982 |