3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
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…