A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Improved Parallel Implementations of Gusfield's Cut Tree Algorithm
Anais do XII Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2011)
This work presents parallel versions of Gusfield's cut tree algorithm and the proposal of two heuristics aimed at improving their performance. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have a vast number of applications in combinatorial optimization and in the analysis of networks originated in many applied fields. However, surprisingly few works have been published on the practical performance of cut treedoi:10.5753/wscad.2011.17275 fatcat:oevh6bw2sbbyfpaxnnnwktljoa