5 citations · 10 across the 4 of their papers we have counts for
1 paper · 2 filters
Christopher Engström, Sergei Silvestrov
In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known `strongly connected components' as we…