Computing the all the subgraphs of graph G where all degree of vertices is greater than K
- Every vertex keeps two tags: is_deleted, current_degree
- If the degree of vertex is smaller than K, it will be deleted from the graph G. Then all adjacent vertices will be informed of this deletion.
- Informed adjacent vertives update their degree.
Indirected (or paired directed) graph
all vertices with degree greater than K