Parallel Implementations of Gusfield’s Cut Tree Algorithm

  • Jaime Cohen
  • Luiz A. Rodrigues
  • Fabiano Silva
  • Renato Carmo
  • André L. P. Guedes
  • Elias P. DuarteJr.
Conference paper

DOI: 10.1007/978-3-642-24650-0_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7016)
Cite this paper as:
Cohen J., Rodrigues L.A., Silva F., Carmo R., Guedes A.L.P., Duarte E.P. (2011) Parallel Implementations of Gusfield’s Cut Tree Algorithm. In: Xiang Y., Cuzzocrea A., Hobbs M., Zhou W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jaime Cohen
    • 1
    • 2
  • Luiz A. Rodrigues
    • 1
    • 3
  • Fabiano Silva
    • 1
  • Renato Carmo
    • 1
  • André L. P. Guedes
    • 1
  • Elias P. DuarteJr.
    • 1
  1. 1.Department of InformaticsFederal University of ParanáCuritibaBrazil
  2. 2.Department of InformaticsParaná State UniversityPonta GrossaBrazil
  3. 3.Department of Computer ScienceWestern Paraná State UniversityCascavelBrazil

Personalised recommendations