Parallel implementations of Gusfield's cut tree algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7016 LNCS, Issue PART 1, 2011, Pages 258-269

  Cohen, Jaime ^a,b   Rodrigues, Luiz A ^a,c   Silva, Fabiano ^a   Carmo, Renato ^a   Guedes, André L P ^a   Duarte Jr , Elias P ^a  

^a FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

^b University of Ponta Grossa   (Brazil)

^c UNIVERSIDADE ESTADUAL DO OESTE DO PARANÁ   (Brazil)

Author keywords

Cut tree algorithms; Graph edge connectivity; MPI; OpenMP

Indexed keywords

APPLIED FIELD; COMPACT REPRESENTATION; CUT-TREE; DATA SETS; EDGE CONNECTIVITY; MPI; OPENMP; PARALLEL IMPLEMENTATIONS; PARALLEL VERSION; SYNTHETIC GRAPHS; UNDIRECTED GRAPH;

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); COMBINATORIAL OPTIMIZATION; NETWORK ARCHITECTURE; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80455144655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24650-0_22     Document Type: Conference Paper

References (24)

1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47-97 (2002)
2. Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th int'l conference on World Wide Web. WWW 2007. ACM, NY (2007)
3. Bader, D.A., Sachdeva, V.: A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. In: ISCA PDCS (2005)
4. Batagelj, V., Mrvar, A.: Pajek datasets (2006), http://vlado.fmf.uni-lj. si/pub/networks/data/
5. Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
6. Chapman, B., Jost, G., Van der Pas, R.: Using OpenMP: portable shared memory parallel programming. MIT Press, Cambridge (2008)
7. Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. pp. 324-333. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1997)
8. Cherkassky, B.V., Goldberg, A.V.: On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19(4), 390-410 (1997)
9. Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Mathematics 1(4) (2003)
10. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45, 783-797 (1998)
11. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35, 921-940 (1988)
12. Goldberg, A.V., Tsioutsiouliklis, K.: Cut tree algorithms. In: SODA 1999: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, USA (1999)
13. Gomory, R.E., Hu, T.C.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics 9(4), 551-570 (1961)
14. Görke, R., Hartmann, T.,Wagner, D.: Dynamic Graph Clustering Using Minimum-Cut Trees. In: Dehne, F., Gavrilova, M., Sack, J.R., Tóth, C. (eds.) WADS 2009. LNCS, vol. 5664, pp. 339-350. Springer, Heidelberg (2009)
15. Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM J. Comput. 19, 143-155 (1990)
16. Hong, B., He, Z.: An asynchronous multi-threaded algorithm for the maximum network flow problem with non-blocking global relabeling heuristic. IEEE Transactions on Parallel and Distributed Systems 99 (2010)
17. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. In: ACM Trans. on Knowledge Discovery from Data, ACM TKDD (2007)
18. Letchford, A., Reinelt, G., Theis, D.: Odd minimum cut-sets and b-matchings revisited. SIAM Journal on Discrete Mathematics 22(4) (2008)
19. Mitrofanova, A., Farach-Colton, M., Mishra, B.: Efficient and robust prediction algorithms for protein complexes using gomory-hu trees. In: Altman, R.B., Dunker, A.K., Hunter, L., Murray, T., Klein, T.E. (eds.) Pacific Symposium on Biocomputing, pp. 215-226 (2009)
20. Nagamochi, H., Ibaraki, T.: Algorithmic Aspects of Graph Connectivity. Cambridge University Press, New York (2008)
21. Rao, G., Stone, H., Hu, T.: Assignment of tasks in a distributed processor system with limited memory. IEEE Transactions on Computers 28, 291-299 (1979)
22. Saran, H., Vazirani, V.V.: Finding k cuts within twice the optimal. SIAM J. Comput. 24(1), 101-108 (1995)
23. Tuncbag, N., Salman, F.S., Keskin, O., Gursoy, A.: Analysis and network representation of hotspots in protein interfaces using minimum cut trees. Proteins: Structure, Function, and Bioinformatics 78(10), 2283-2294 (2010)
24. Watts, D.J., Strogatz, S.H.: Collective dynamics of 'small-world' networks. Nature 393(6684), 440-442 (1998)