A parallel algorithm for enumerating all the maximal k-plexes

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

Volumn 4819 LNAI, Issue , 2007, Pages 476-483

  Wu, Bin ^a   Pei, Xin ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; GRAPH THEORY; PROBLEM SOLVING;

MAXIMAL K-PLEXES; RANDOM GRAPHS;

PARALLEL ALGORITHMS;

EID: 38549155471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77018-3_47     Document Type: Conference Paper

References (5)

1. Seidman, S.B., Foster, B.L.: A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology 6, 139-154 (1978)
2. Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem (2006), http://ie.tamu.edu/people/faculty/Hicks
3. Hanneman, R.: Introduction to Social Network, Methods (1998), http://faculty.ucr.edu/ hanneman/networks/nettext.pdf
4. Bron, C., Kerbosch, J.: Algorithm 457, Finding all cliques of an undirected graph. Proceedings of the ACM 16(9), 575-577 (1973)
5. Alba, R.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology 3, 113-126(1973)