Enumerating Isolated Cliques in Temporal Networks

09/13/2019 ∙ by Hendrik Molter, et al. ∙ 0

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.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.