[00682] Cover Temporal Networks with Densest Subgraphs
Session Time & Room : 2E (Aug.22, 17:40-19:20) @G304
Type : Contributed Talk
Abstract : Temporal networks have been introduced to represent the dynamics of a complex system.
In this contribution we consider a problem that asks for a collection of dense temporal subgraphs that covers a given temporal graph. The problem has application in the identification of communities of a complex system, for example of a social network.
We present a result on the computational complexity of the problem and a polynomial-time approximation algorithm.
