A scalable, parallel algorithm for maximal clique enumeration

Journal of Parallel and Distributed Computing

Volumn 69, Issue 4, 2009, Pages 417-428

  Schmidt, Matthew C ^a,b   Samatova, Nagiza F ^a,b   Thomas, Kevin ^c   Park, Byung Hoon ^b  

^a North Carolina State University   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

^c CRAY INC   (United States)

Author keywords

Biological networks; Cray XT; Dynamic load balancing; High performance computing; Maximal clique enumeration; Parallel graph algorithms

Indexed keywords

COMPUTER ARCHITECTURE; DYNAMIC LOADS; DYNAMIC PROGRAMMING; GENE EXPRESSION; PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

BIOLOGICAL NETWORKS; CRAY XT; DYNAMIC LOAD BALANCING; HIGH-PERFORMANCE COMPUTING; MAXIMAL CLIQUE ENUMERATION; PARALLEL GRAPH ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 61449140888     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.01.003     Document Type: Article

References (41)

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 1994, pp. 487-499
2. Akkoyunlu E.A. The enumeration of maximal cliques of large graphs. SIAM Journal on Computing 2 1 (1973) 1-6
3. Altschul S.F., Gish W., Miller W., Myers E.W., and Lipman D.J. Basic local alignment search tool. Journal of Molecular Biology 215 3 (1990) 403-410
4. Augustson J.G., and Minker J. An analysis of some graph theoretical cluster techniques. Journal of the ACM 17 4 (1970) 571-588
5. Avis D., and Fukuda K. Reverse search for enumeration. Discrete Applied Mathematics 65 1-3 (1996) 21-46
6. D.A. Bader, K. Madduri, GTgraph: A synthetic graph generator suite, 2006, http://www.cc.gatech.edu/~kamesh/GTgraph/
7. Bednarek A.R., and Taulbee O.E. On maximal chains. Revue Roumaine de Mathematiques pures et Appliquees 11 1 (1966) 23-25
8. Bonner R.E. On some clustering techniques. IBM Journal of Research and Development 8 1 (1964) 22-32
9. E. Brierstone, Cliques and generalized cliques in a finite linear graph, Unpublished Report
10. Bron C., and Kerbosch J. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16 9 (1973) 575-577
11. D. Chakrabarti, Y. Zhan, C. Faloutsos, R-mat: A recursive model for graph mining, in: Proc. of the 4th SIAM Int. Conf. on Data Mining, SDM, 2004, pp. 442-446
12. Chen Y., and Crippen G.M. A novel approach to structural alignment using realistic structural and environmental information. Protein Science 14 12 (2005) 2935-2946
13. Chiba N., and Nishizeki T. Arboricity and subgraph listing algorithms. SIAM Journal on Computing 14 1 (1985) 210-223
14. Cormen T., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), McGraw-Hill
15. N. Du, W. Bin, X. Liutong, W. Bai, P. Xin, A parallel algorithm for enumerating all maximal cliques in complex network, in: Proc. of ICDM Workshops, 2006, pp. 320-324
16. Finkel R., and Manber U. Dib-a distributed implementation of backtracking. ACM Transactions on Programming Languages Systems 9 2 (1987) 235-256
17. Grindley H.M., Artymiuk P.J., Rice D.W., and Willett P. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. Journal of Molecular Biology 229 3 (1993) 707-721
18. Harley E., Bonner A., and Goodman N. Uniform integration of genome mapping data using intersection graphs. Bioinformatics 17 6 (2001) 487-494
19. Harary F., and Ross I.C. A procedure for clique detection using the group matrix. Sociometry 20 3 (1957) 205-215
20. Johnston H.C. Cliques of a graph: Variations on the Bron-Kerbosch algorithm. International Journal of Parallel Programming 5 3 (1976) 209-238
21. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Information Processing Letters 27 3 (1988) 119-123
22. Koch I. Fundamental study: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science 250 1-2 (2001) 1-30
23. Kose F., Weckwerth W., Linke T., and Fiehn O. Visualizing plant metabolomic correlation networks using cliquemetabolite matrices. Bioinformatics 17 12 (2001) 1198-1208
24. Kumar V., Grama A.Y., and Vempaty N.R. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing 22 1 (1994) 60-79
25. Lawler E.L., Lenstra J.K., and Kan A.H.G.R. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM Journal on Computing 9 3 (1980) 558-565
26. Loukakis E. A new backtracking algorithm for generating the family of maximal independent sets of a graph. Computers & Mathematics with Applications 9 4 (1983) 583-589
27. Loukakis E., and Tsouros C. A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically. Computing 27 4 (1981) 349-366
28. K. Makino, T. Uno, New algorithms for enumerating all maximal cliques, in: Proc. of the 9th Scandinavian Workshop on Algorithm Theory, SWAT, 2004, pp. 260-272
29. Marcus M.P. Derivation of maximal compatibles using boolean algebra. IBM Journal of Research and Development 8 5 (1964) 537-538
30. Moon J.W., and Moser L. On cliques in graphs. Israel Journal of Mathematics 3 1 (1965) 23-28
31. Mulligan G.D., and Corneil D.G. Corrections to Bierstone's algorithm for generating cliques. Journal of the ACM 19 2 (1972) 244-247
32. Pardalos P.M., and Xue J. The maximum clique problem. Journal of Global Optimization 4 3 (1994) 301-328
33. Park B.-H., Samatova N.F., Karpinets T., Jallouk A., Molony S., Horton S., and Arcangeli S. Data-driven data-intensive computing for modelling and analysis of biological networks: Application to bioethanol production. J. Phys.: Conf. Ser. 78 (2007) 012061
34. Paull M.C., and Unger S. Minimizing the number of states in incompletely specified sequential switching functions. IRE Transactions on Electronic Computers 8 (1959) 356-367
35. Rokhlenko O., Wexler Y., and Yakhini Z. Similarities and differences of gene expression in yeast stress conditions. Bioinformatics 23 2 (2007) e184-e190
36. R. Rowe, G. Creamer, S. Hershkop, S.J. Stolfo, Automated social hierarchy detection through email network analysis, in: Proc. of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, 2007, pp. 109-117
37. Tabb D.L., Thompson M.R., Khalsa-Moyers G., VerBerkmoes N.C., and Mcdonald W.H. MS2Grouper: group assessment and synthetic replacement of duplicate proteomic tandem mass spectra. Journal of the American Society for Mass Spectrometry 16 8 (2005) 1250-1261
38. Tomita E., Tanaka A., and Takahashi H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science 363 1 (2006) 28-42
39. Tsukiyama S., Ide M., Ariyoshi H., and Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing 6 3 (1977) 505-517
40. Y. Zhang, F. Abu-Khzam, N. Baldwin, E. Chesler, M. Langston, N.F. Samatova, Genome-scale computational approaches to memory-intensive applications in systems biology, in: Proc. of the 2005 ACM/IEEE Conference on Supercomputing, 2005, p. 12
41. Zhang B., Park B.-H., Karpinets T., and Samatova N.F. From pull-down data to protein interaction networks and complexes with biological relevance. Bioinformatics 24 7 (2008) 979-986