Subgraph enumeration in large social contact networks using parallel color coding and streaming

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2010, Pages 594-603

  Zhao, Zhao ^a   Khan, Maleq ^a   Kumar, V S Anil ^a   Marathe, Madhav V ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; COLOR CODING; COMPUTATIONAL PROBLEM; CONTACT NETWORKS; FUNCTIONAL PROPERTIES; PARALLELIZATIONS; RANDOMIZED APPROXIMATION SCHEMES; SOCIAL NETWORKS; SUBGRAPH ENUMERATION ALGORITHM; SUBGRAPHS; UNDERLYING NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 78649556537     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2010.67     Document Type: Conference Paper

References (14)

1. N. Alon, P. Dao, I. Hajirasouliha, F. Hormozdiari, and S. Cenk Sahinalp. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24(13):241-249, July 2008.
2. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast network decomposition. In PODC, pages 169-177, 1992.
3. C. Barrett, D. Beckman, M. Khan, V.S. Anil Kumar, M. Marathe, P. Stretz, T. Dutta, and B. Lewis. Generation and analysis of large synthetic social contact networks. In Winter Simulation Conference, 2009.
4. C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 1973.
5. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(10):1367-1372, October 2004.
6. M. Gonen, D. Ron, and Y. Shavitt. Counting stars and other small subgraphs in sublinear time. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
7. M. Gonen and Y. Shavitt. Approximating the number of network motifs. In The 6th Workshop on Algorithms and Models for the Web Graph (WAW), 2009.
8. F. Huffner, S. Wernicke, and T. Zichner. Algorithm engineering for color-coding with applications to signaling pathway detection. Algorithmica, 2007.
9. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. IEEE International Conference Data Mining (ICDM), 2001.
10. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Mining and Knowledge Discovery, 2005.
11. J. Leskovec, A. Singh, and J. Kleinberg. Patterns of influence in a recommendation network. In Proc. Pacific- Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2006.
12. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, pages 824-827, 2002.
13. Matthew C. Schmidt, Nagiza F. Samatova, Kevin Thomas, and Byung-Hoon Park. A scalable, parallel algorithm for maximal clique enumeration. In Journal of Parallel and Distributed Computing, 2009.
14. T. Wang, J. Touchman, W. Zhang, E. Suh, and G. Xue. A parallel algorithm for extracting transcriptional regulatory network motifs. In IEEE Symposium on Bioinformatics and Bioengineering, 2005.