Distance-generalized Core Decomposition

04/15/2019
by   Francesco Bonchi, et al.
0

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 distance-based generalization of the notion of k-core, which we refer to as the (k,h)-core, i.e., the maximal subgraph in which every vertex has at least k other vertices at distance ≤ h within that subgraph. We study the properties of the (k,h)-core showing that it preserves many of the nice features of the classic core decomposition (e.g., its connection with the notion of distance-generalized chromatic number) and it preserves its usefulness to speed-up or approximate distance-generalized notions of dense structures, such as h-club. Computing the distance-generalized core decomposition over large networks is intrinsically complex. However, by exploiting clever upper and lower bounds we can partition the computation in a set of totally independent subcomputations, opening the door to top-down exploration and to multithreading, and thus achieving an efficient algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2021

Fast computation of distance-generalized cores using sampling

Core decomposition is a classic technique for discovering densely connec...
research
10/18/2020

Arboricity Games: the Core and the Nucleolus

The arboricity of a network is the minimum number of forests needed to c...
research
05/19/2020

Coalition and Core in Resource Allocation and Exchange

In discrete exchange economies with possibly redundant and joint ownersh...
research
05/31/2023

A Generalization of the Graham-Pollak Tree Theorem to Steiner Distance

Graham and Pollak showed that the determinant of the distance matrix of ...
research
05/24/2018

Modular Decomposition of Graphs and the Distance Preserving Property

Given a graph G, a subgraph H is isometric if d_H(u,v) = d_G(u,v) for ev...
research
08/13/2018

Large Graph Exploration via Subgraph Discovery and Decomposition

We are developing an interactive graph exploration system called Graph P...
research
10/12/2021

Cycle-Tree Guided Attack of Random K-Core

The K-core of a graph is the maximal subgraph within which each vertex i...

Please sign up or login with your details

Forgot password? Click here to reset