Adaptive Community Search in Dynamic Networks

11/10/2020
by   Ioanna Tsalouchidou, et al.
0

Community search is a well-studied problem which, given a static graph and a query set of vertices, requires to find a cohesive (or dense) subgraph containing the query vertices. In this paper we study the problem of community search in temporal dynamic networks. We adapt to the temporal setting the notion of network inefficiency which is based on the pairwise shortest-path distance among all the vertices in a solution. For this purpose we define the notion of shortest-fastest-path distance: a linear combination of the temporal and spatial dimensions governed by a user-defined parameter. We thus define the Minimum Temporal-Inefficiency Subgraph problem and show that it is . We develop an algorithm which exploits a careful transformation of the temporal network to a static directed and weighted graph, and some recent approximation algorithm for finding the minimum Directed Steiner Tree. We finally generalize our framework to the streaming setting in which new snapshots of the temporal graph keep arriving continuously and our goal is to produce a community search solution for the temporal graph corresponding to a sliding time window.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

Better Fewer but Better: Community Search with Outliers

Given a set of vertices in a network, that we believe are of interest fo...
research
11/25/2021

On the Strong Metric Dimension of directed co-graphs

Let G be a strongly connected directed graph and u,v,w∈ V(G) be three ve...
research
07/15/2020

Minimum Weight Pairwise Distance Preservers

In this paper, we study the Minimum Weight Pairwise Distance Preservers ...
research
06/08/2022

On the quick search for the shortest paths in an unweighted dynamic graph by its projections in brief

For the first time proposed: a method for representing the projections o...
research
05/27/2021

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

In static graphs, the betweenness centrality of a graph vertex measures ...
research
02/18/2020

Noisy source location on a line

We study the problem of locating the source of an epidemic diffusion pro...
research
04/01/2019

Approximation algorithms and an integer program for multi-level graph spanners

Given a weighted graph G(V,E) and t > 1, a subgraph H is a t--spanner of...

Please sign up or login with your details

Forgot password? Click here to reset