Parallel cut tree algorithms

Abstract A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of vertices of an undirected graph. Cut trees solve the all pairs minimum s – t -cut problem efficiently. Cut trees have a large number of applications including the solution of important combinatorial problems in fields such as graph clustering and graph connectivity. They have also been applied to scheduling problems, social network analysis, biological data analysis, among others. Two sequential algorithms to compute a cut tree of a capacitated undirected graph are well known: the Gomory–Hu algorithm and the Gusfield algorithm. In this work three parallel cut tree algorithms are presented, including parallel versions of Gusfield and Gomory–Hu algorithms. A hybrid algorithm that combines techniques from both algorithms is proposed which provides a more robust performance for arbitrary instances. Experimental results show that the three algorithms achieve significant speedups on real and synthetic graphs. We discuss the trade-offs between the alternatives, each of which presents better results given the characteristics of the input graph. On several instances the hybrid algorithm outperformed both other algorithms, being faster than the parallel Gomory–Hu algorithm on most instances.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Elias Procópio Duarte,et al.  A Parallel Implementation of Gomory-Hu's Cut Tree Algorithm , 2012, 2012 IEEE 24th International Symposium on Computer Architecture and High Performance Computing.

[3]  Ozlem Keskin,et al.  Analysis and network representation of hotspots in protein interfaces using minimum cut trees , 2010, Proteins.

[4]  Ramaswamy Chandrasekaran,et al.  Multiroute flows: Cut-trees and realizability , 2005, Discret. Optim..

[5]  Bud Mishra,et al.  Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees , 2008, Pacific Symposium on Biocomputing.

[6]  Dan Gusfield,et al.  A little knowledge goes a long way: faster detection of compromised data in 2-D tables , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[7]  Jon M. Kleinberg,et al.  Wherefore art thou R3579X? , 2011, Commun. ACM.

[8]  Douglas R. Shier,et al.  A paradigm for listing (s, t)-cuts in graphs , 2005, Algorithmica.

[9]  András A. Benczúr,et al.  Counterexamples for Directed and Node Capacitated Cut-Trees , 1995, SIAM J. Comput..

[10]  Glencora Borradaile,et al.  Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time , 2010, FOCS.

[11]  Catherine C. McGeoch.  A Guide to Experimental Algorithmics , 2012 .

[12]  Pabitra Mitra,et al.  Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[13]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[14]  R. Ravi,et al.  Reconstructing edge-disjoint paths , 2003, Oper. Res. Lett..

[15]  Toshihide Ibaraki,et al.  Implementing an efficient minimum capacity cut algorithm , 1994, Math. Program..

[16]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[18]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[19]  Andrew V. Goldberg,et al.  Cut tree algorithms , 1999, SODA '99.

[20]  Zhengyu He,et al.  An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic , 2011, IEEE Transactions on Parallel and Distributed Systems.

[21]  Aidong Zhang,et al.  Cluster analysis for gene expression data: a survey , 2004, IEEE Transactions on Knowledge and Data Engineering.

[22]  Debmalya Panigrahi,et al.  An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs , 2007, STOC '07.

[23]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[24]  Andrew V. Goldberg,et al.  Experimental study of minimum cut algorithms , 1997, SODA '97.

[25]  Dorothea Wagner,et al.  Dynamic Graph Clustering Using Minimum-Cut Trees , 2009, J. Graph Algorithms Appl..

[26]  Joseph Naor,et al.  Cut problems in graphs with a budget constraint , 2006, J. Discrete Algorithms.

[27]  Debmalya Panigrahi,et al.  Efficient algorithms for computing all low s-t edge connectivities and related problems , 2007, SODA '07.

[28]  Afonso Ferreira,et al.  Generalized Parametric Multi-terminal Flows Problem , 2003, WG.

[29]  Christos D. Zaroliagis,et al.  All-Pairs Min-Cut in Sparse Networks , 1995, FSTTCS.

[30]  Weifa Liang,et al.  Flow equivalent trees in undirected node-edge-capacitated planar graphs , 2006, Inf. Process. Lett..

[31]  Yash P. Aneja,et al.  Parametric Min-cuts Analysis in a Network , 2003, Discret. Appl. Math..

[32]  Vijay V. Vazirani,et al.  Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..

[33]  Dorothea Wagner,et al.  Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees , 2011, WADS.

[34]  Chris Jermaine,et al.  Computing program modularizations using the k-cut method , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).

[35]  Claus-Peter Schnorr,et al.  Bottlenecks and Edge Connectivity in Unsymmetrical Networks , 1979, SIAM J. Comput..

[36]  Dirk Oliver Theis,et al.  Odd minimum cut sets and b-matchings revisited , 2006, SIAM J. Discret. Math..

[37]  Eli V. Olinick,et al.  The use of sparsest cuts to reveal the hierarchical community structure of social networks , 2008, Soc. Networks.

[38]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[39]  Harold S. Stone,et al.  Assignment of Tasks in a Distributed Processor System with Limited Memory , 1979, IEEE Transactions on Computers.

[40]  Ron Shamir,et al.  A clustering algorithm based on graph connectivity , 2000, Inf. Process. Lett..

[41]  Toshihide Ibaraki,et al.  Algorithmic Aspects of Graph Connectivity , 2008, Encyclopedia of Mathematics and its Applications.

[42]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[43]  David Hartvigsen,et al.  Generalizing the all-pairs min cut problem , 1995, Discret. Math..

[44]  David A. Bader,et al.  A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic , 2006, PDCS.

[45]  Robert E. Tarjan,et al.  Graph Clustering and Minimum Cut Trees , 2004, Internet Math..

[46]  Béla Bollobás,et al.  Random Graphs , 1985 .

[47]  Refael Hassin,et al.  Flow trees for vertex-capacitated networks , 2007, Discret. Appl. Math..

[48]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[49]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.