Exact Algorithms for the Maximum 2-plex Problem
碩士 === 國立中正大學 === 資訊工程所 === 98 === The {em $k$-plex} is a criteria to define a cohesive subgroup in networks. Given a graph $G=(V, E)$, a vertex set $Ssubseteq V$ is called a {em $k$-plex} if the degree of every vertex in the induced subgraph $G[S]$ is at least $|S|-k$. Obviously finding the maximum...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/43664235005459681281 |