Stream graphs model highly dynamic networks in which nodes and/or links arrive and/or leave over time. Strongly connected components in stream graphs were defined recently, but no algorithm was provided to compute them. We present here several solutions with polynomial time and space complexities, each with its own strengths and weaknesses. We provide an implementation and experimentally compare the algorithms in a wide variety of practical cases. In addition, we propose an approximation scheme that significantly reduces computation costs, and gives even more insight on the dataset.
@article{arxiv.2011.08054,
title = {Strongly Connected Components in Stream Graphs: Computation and Experimentations},
author = {Léo Rannou and Clémence Magnien and Matthieu Latapy},
journal= {arXiv preprint arXiv:2011.08054},
year = {2021}
}