최대 클릭 문제의 분할정복 알고리즘

논문상세정보
' 최대 클릭 문제의 분할정복 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 전산공학
  • closedneighborhood
  • completegraph
  • divide-and-conquer
  • maximumclique
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
563 0

0.0%

' 최대 클릭 문제의 분할정복 알고리즘' 의 참고문헌

  • The Clique Algorithm
  • Petersen Graph
  • On Cliques in Graphs
    J. W. Moon Israel Journal of Mathematics 3 (1) : 23 ~ 28 [1965]
  • Note on Finding a Maximum Clique in a Graph Using BDDs
    Mukul S. Bansal Australasian Journal of Combinatorics 32 : 253 ~ 258 [2005]
  • Maximum Weight Independent Set in Trees
    S. Pawagi BIT Numerical Mathematics 27 (2) : 170 ~ 180 [1987]
  • Finding Clique Using Backtracking Algorithm
    H. J. Kim University of Washington [2006]
  • Exact Parallel Maximum Clique Algorithm for General and Protein Graphs
    M. Depolli Journal of Chemical Information and Modeling 53 (9) : 2217 ~ 2228 [2013]
  • Exact Algorithms for Maximum Clique : A Computational Study
    P. Prosser Algorithms 5 (4) : 545 ~ 587 [2012]
  • ESI 6448 Discrete Optimization Theory: Cliques, Quasi-cliques and Clique Partitions in Graphs
  • DNA Solution of the Maximal Clique Problem
    Q. Ouyang Science 278 (5337) : 446 ~ 449 [1997]
  • Complexity of Computer Computations
    R. M. Karp Plenum : 85 ~ 103 [1972]
  • Complete Graph
  • Clique and Coloring Problems: A Brief Information, with Project Ideas
    M. A. Trick EDT [1994]
  • Clique
    Y. D. Lyuu [2004]
  • CS21: Decidability and Tractability
    C. Umans Computer Science, California Institute of Technology [2009]
  • Biomedical Engineering, Trends in Electronics, Communications and Software, Chapter32. Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
    A. Laskovski Intech : 625 ~ 640 [2011]
  • Algorithm 457 : Finding All Cliques of an Undirected Graph
    C. Bron Communications of the ACM 16 (9) : 575 ~ 577 [1973]
  • A Polynomial-Time Algorithm for the Maximum Clique Problem
    Z. O. Akbari IEEE/ACIS 12th International Conference on Computer and Information Science : 503 ~ 507 [2013]
  • A Fast Algorithm for the Maximum Clique Problem
    P. R. J. Östergård Discrete Applied Mathematics 120 (1-3) : 197 ~ 207 [2002]