Listing all maximal k-plexes in temporal graphs

Matthias Bentert, Anne Sophie Himmel, Hendrik Molter, Marco Marik, Rolf Niedermeier, Rene Saitenmacher

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Modern-day social networks evolve over time, that is, new contacts appear and old contacts may disappear. They can be modeled as temporal graphs where interactions between vertices (people) are represented by time-stamped edges. One of the most fundamental problems in social network analysis is community detection and within community detection, one of the most basic primitives to model a community is a clique. Addressing the problem of finding communities in temporal networks, Viard et al. [TCS 2016] introduced Δ-cliques as a natural temporal version of cliques. Himmel et al. [SNAM 2017] showed how to adapt the well-known Bron-Kerbosch algorithm for listing static cliques to listing Δ-cliques. We continue this work and improve and extend this algorithm to list temporal k-plexes, a temporal version of k-plexes, which are one of many popular clique relaxations. We define a Δ-$k$-plex as a set of vertices with a lifetime, where during the lifetime each vertex has an edge to all but at most k-1 vertices at least once every Δ + 1 consecutive time steps. We develop an algorithm for listing all maximal Δ-$k$-plexes and perform experiments on real-world networks that demonstrate the practical feasibility of our approach.

Original languageEnglish
Title of host publicationProceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018
EditorsAndrea Tagarelli, Chandan Reddy, Ulrik Brandes
PublisherInstitute of Electrical and Electronics Engineers
Pages41-46
Number of pages6
ISBN (Electronic)9781538660515
DOIs
StatePublished - 24 Oct 2018
Externally publishedYes
Event10th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018 - Barcelona, Spain
Duration: 28 Aug 201831 Aug 2018

Publication series

NameProceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018

Conference

Conference10th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018
Country/TerritorySpain
CityBarcelona
Period28/08/1831/08/18

ASJC Scopus subject areas

  • Sociology and Political Science
  • Communication
  • Computer Networks and Communications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Listing all maximal k-plexes in temporal graphs'. Together they form a unique fingerprint.

Cite this