Distance-generalized Core Decomposition

Francesco Bonchi, Arijit Khan, Lorenzo Severini

The $k$-core of a graph is defined as the maximal subgraph in which every vertex is connected to at least $k$ other vertices within that subgraph. In this work we introduce a dista…