Tag Archives: graph-connectivity

Find k-cores of an undirected graph

Given a graph G and an integer K, K-cores of the graph are connected components that are left after all vertices of degree less than k have been removed (Source wiki) Example: Input : Adjacency list representation of graph shown on left side of below diagram Output: K-Cores : [2] -> 3 -> 4 ->… Read More »