Algorithm 4 is to get the maximized k-plex of Q.
Next, (q in Q ), (Q subset H) implies H is maximal k-plex of q. (square ).
Suppose (H= bigcap _{i=1}^{alpha } C_i) is maximized k-plex of Q, disconnected.
Let (M_i) denote set of all maximal k-plex of (Q_i).
If all maximized k-plex of Q is not connected, then there does not exist connected k-plex consisting of Q.
For each (q in Q), the maximized connected k-plex consisting of Q must be one of maximal k-plex of q.
Given a graph G V, E) and k, the k-plex problem is to decide whether there exists a k-plex of size c in G.
Unqualified nodes refer to those that are not able to produce maximized k-plex of Q or even k-plex of Q. Next, we introduce two strategies for pruning unqualified nodes: one is based on the query distance, the other is based on the core number.
To get maximal k-plex of Q, MS is initialized with (R={Q}, P={v: vin N(Q), R = { v: v in N(Q), {v}cup Q text {,is,k,=,plex } }, X=emptyset ).
The NaiveEnum (shown in algorithm 2) is used to generate all k-plexes of Q. Starting with Q, it searches each of (Q's) neighbors to check whether it is validate to extend Q until there is no such neighbors.
