메뉴 건너뛰기




Volumn 6, Issue , 2010, Pages

A maximum clique algorithm based on MapReduce

Author keywords

MapReduce; Maximum clique; Social network

Indexed keywords


EID: 78149347375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICACTE.2010.5579377     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 3
    • 0025521978 scopus 로고
    • An exact algorithm for the maximum clique problem [J]
    • Randy CARRAGHAN, Panos M. PARDALOS. AN EXACT ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM [J].Operations Research Letters, 1990,9(6): 375-382. .
    • (1990) Operations Research Letters , vol.9 , Issue.6 , pp. 375-382
    • Carraghan, R.1    Pardalos, P.M.2
  • 6
    • 84976668743 scopus 로고
    • Finding all cliques of an undirected graph[J]
    • Bron, C, Kerbosch, LFinding all cliques of an undirected graph[J]. Communications of the ACM ,1973,16(9), 575-577.
    • (1973) Communications of the ACM , vol.16 , Issue.9 , pp. 575-577
    • Bron, C.1    Kerbosch, L.2
  • 13
    • 68249124152 scopus 로고    scopus 로고
    • Algorithms and experiments for clique relaxations-finding maximum s-Plexes[C]
    • Hannes Moser, Rolf Niedermeier, and Manuel Sorge. Algorithms and experiments for clique relaxations-finding maximum s-plexes
    • Hannes Moser,Rolf Niedermeier,Manual Sorge. Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes[C]. Hannes Moser, Rolf Niedermeier, and Manuel Sorge. Algorithms and experiments for clique relaxations-finding maximum s-plexes. International Symposium on Experimental Algorithms.2009: 233-244.
    • (2009) International Symposium on Experimental Algorithms , pp. 233-244
    • Moser, H.1    Niedermeier, R.2    Sorge, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.