Adaptive Community Search in Dynamic Networks
Ioanna Tsalouchidou, Francesco Bonchi, Ricardo Baeza-Yates

TL;DR
This paper introduces a novel approach to community search in dynamic networks by defining a temporal inefficiency measure, formulating the problem as NP-hard, and proposing an approximation algorithm with streaming capabilities.
Contribution
It adapts community search to temporal networks using a new shortest-fastest-path distance and develops an approximation algorithm for the NP-hard problem, including a streaming extension.
Findings
The problem of minimum temporal-inefficiency subgraph is NP-hard.
An approximation algorithm based on transforming the temporal network to a static graph was developed.
The framework supports streaming data with sliding window community search.
Abstract
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 \emph{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 \emph{shortest-fastest-path distance}: a linear combination of the temporal and spatial dimensions governed by a user-defined parameter. We thus define the \textsc{Minimum Temporal-Inefficiency Subgraph} problem and show that it is \NPhard. 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
