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.

中文翻译：

---

流图中的强连通分量：计算和实验

流图模拟高度动态的网络，其中节点和/或链接随时间到达和/或离开。最近定义了流图中的强连通分量，但没有提供计算它们的算法。我们在这里展示了多项式时间和空间复杂度的解决方案，每个解决方案都有自己的优点和缺点。我们提供了一个实现，并在各种实际案例中对算法进行了实验比较。此外，我们提出了一种近似方案，可显着降低计算成本，并提供对数据集的更多了解。