Enumerating Isolated Cliques in Temporal Networks

by   Hendrik Molter, et al.

Isolation has been shown to be a valuable concept in the world of clique enumeration. Motivated by recent work on enumerating cliques in temporal (or time-varying) graphs, we lift the isolation concept to this setting. We discover that the addition of the time dimension leads to six distinct natural isolation concepts. Our main contribution are algorithms for the enumeration of five of these six clique types, that are fixed-parameter-tractable with respect to the "degree of isolation". On the empirical side, we implement and test these algorithms on (temporal) social network data, obtaining encouraging preliminary results.


page 1

page 2

page 3

page 4


Clique Cover of Graphs with Bounded Degeneracy

Structural parameters of graph (such as degeneracy and arboricity) had r...

Isolation of k-cliques

For any positive integer k and any n-vertex graph G, let ι(G,k) denote t...

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics

Most instruments - formalisms, concepts, and metrics - for social networ...

A Fresh Look at the Architecture and Performance of Contemporary Isolation Platforms

With the ever-increasing pervasiveness of the cloud computing paradigm, ...

On Temporal Isolation Assessment in Virtualized Railway Signaling as a Service Systems

Railway signaling systems provide numerous critical functions at differe...

First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal (Δ, γ)Cliques of a Temporal Network

A Temporal Network (also known as Link Stream or Time-Varying Graph) is ...

On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network

A temporal network is a mathematical way of precisely representing a tim...