메뉴 건너뛰기




Volumn 5313 LNCS, Issue , 2008, Pages 41-55

On effectively finding maximal quasi-cliques in graphs

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS;

EID: 58349096054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92695-5_4     Document Type: Conference Paper
Times cited : (80)

References (14)
  • 1
    • 0000546425 scopus 로고    scopus 로고
    • Classifying molecular sequences using a linkage graph with their pairwise similarities
    • Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoretical Computer Science 210(2), 305-325 (1999)
    • (1999) Theoretical Computer Science , vol.210 , Issue.2 , pp. 305-325
    • Matsuda, H.1    Ishihara, T.2    Hashimoto, A.3
  • 4
    • 58349102134 scopus 로고    scopus 로고
    • Clustering in complex networks. I. General formalism
    • Arxiv preprint cond-mat/0608336
    • Serrano, M., Boguñá, M.: Clustering in complex networks. I. General formalism. Arxiv preprint cond-mat/0608336 (2006)
    • (2006)
    • Serrano, M.1    Boguñá, M.2
  • 6
    • 20444504323 scopus 로고    scopus 로고
    • Uncovering the overlapping community structure of complex networks in nature and society
    • Palla, G., Derényi, L, Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814-818 (2005)
    • (2005) Nature , vol.435 , Issue.7043 , pp. 814-818
    • Palla, G.1    Derényi, L.2    Farkas, I.3    Vicsek, T.4
  • 7
    • 0037558827 scopus 로고    scopus 로고
    • Analyzing clique overlap
    • Everett, M., Borgatti, S.: Analyzing clique overlap. Connections 21(1), 49-61 (1998)
    • (1998) Connections , vol.21 , Issue.1 , pp. 49-61
    • Everett, M.1    Borgatti, S.2
  • 10
    • 0141668007 scopus 로고    scopus 로고
    • Reactive local search for the maximum clique problem
    • Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
    • (2001) Algorithmica , vol.29 , Issue.4 , pp. 610-637
    • Battiti, R.1    Protasi, M.2
  • 11
    • 58349111474 scopus 로고    scopus 로고
    • Reactive local search for maximum clique: A new implementation
    • Technical Report DIT-07-018, University of Trento
    • Battiti, R., Mascia, F.: Reactive local search for maximum clique: a new implementation. Technical Report DIT-07-018, University of Trento (2007)
    • (2007)
    • Battiti, R.1    Mascia, F.2
  • 12
    • 0000411214 scopus 로고
    • Tabu search - part i
    • Glover, F.: Tabu search - part i. ORSA Journal on Computing 1(3), 190-260 (1989)
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-260
    • Glover, F.1
  • 13
    • 0001724713 scopus 로고
    • Tabu search - part ii
    • Glover, F.: Tabu search - part ii. ORSA Journal on Computing 2(1), 4-32 (1990)
    • (1990) ORSA Journal on Computing , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 14
    • 33748438995 scopus 로고    scopus 로고
    • Phased local search for the maximum clique problem
    • Pullan, W.: Phased local search for the maximum clique problem. Journal of Combinatorial Optimization 12(3), 303-323 (2006)
    • (2006) Journal of Combinatorial Optimization , vol.12 , Issue.3 , pp. 303-323
    • Pullan, W.1


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