Chapter

Algorithms and Architectures for Parallel Processing

Volume 7016 of the series Lecture Notes in Computer Science pp 258-269

Parallel Implementations of Gusfield’s Cut Tree Algorithm

  • Jaime CohenAffiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of ParanáDepartment of Informatics, Paraná State University
  • , Luiz A. RodriguesAffiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of ParanáDepartment of Computer Science, Western Paraná State University
  • , Fabiano SilvaAffiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of Paraná
  • , Renato CarmoAffiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of Paraná
  • , André L. P. GuedesAffiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of Paraná
  • , Elias P. DuarteJr.Affiliated withCarnegie Mellon UniversityDepartment of Informatics, Federal University of Paraná

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

Graph edge-connectivity Cut tree algorithms MPI OpenMP