Parallel implementations of gusfield's cut tree algorithm

Authors:
Jaime Cohen;Luiz A. Rodrigues;Fabiano Silva;Renato Carmo;André L. P. Guedes;Elias P. Duarte
Affiliations:
Federal University of Paraná, Department of Informatics, Curitiba and Paraná State University at Ponta Grossa, Department of Informatics, Ponta Grossa, Brazil;Federal University of Paraná, Department of Informatics, Curitiba and Western Paraná State University, Department of Computer Science, Cascavel, Brazil;Federal University of Paraná, Department of Informatics, Curitiba, Brazil;Federal University of Paraná, Department of Informatics, Curitiba, Brazil;Federal University of Paraná, Department of Informatics, Curitiba, Brazil;Federal University of Paraná, Department of Informatics, Curitiba, Brazil
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Year:
2011

Citing 14
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Very simple methods for all pairs network flow analysis

SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal

SIAM Journal on Computing
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Experimental study of minimum cut algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Cut tree algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography

Proceedings of the 16th international conference on World Wide Web
Assignment of Tasks in a Distributed Processor System with Limited Memory

IEEE Transactions on Computers
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)

Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
Algorithmic Aspects of Graph Connectivity

Algorithmic Aspects of Graph Connectivity
Odd Minimum Cut Sets and $b$-Matchings Revisited

SIAM Journal on Discrete Mathematics
Dynamic Graph Clustering Using Minimum-Cut Trees

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents parallel versions of Gusfield's cut tree algorithm. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have many 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 tree algorithms. This paper describes two parallel versions of Gusfield's cut tree algorithm and presents extensive experimental results which show a significant speedup on most real and synthetic graphs in our dataset.