A graph algorithm that identifies nested subgraphs where every node has at least k connections within the subgraph.