An Exact Algorithm for the Densest k-set Problem on Maximum Degree Three Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 100 === A densest k-set S in an undirected graph G=(V, E) is a vertex set of size k such that the number of edges in the subgraph induced by S is maximum among all subgraphs induced by k vertices. The concept of densest k-set is often used to define cohesive subgroups i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22465627778082377816 |