연구동향 분석

최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘

이상운(Sang-Un Lee) 2015년

논문상세정보
인용/피인용
' 최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • candidateclique
  • degree
  • maximumclique
  • maximumdegree
  • 차수
  • 최대 클릭
  • 최대차수
  • 후보 클릭
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
54 0

0.0%

' 최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘' 의 참고문헌

  • The Vertex Coloring Algorithm
  • The Clique Algorithm
  • Phased Local Search for the Maximum Clique Problem
    W. Pullan Journal of Combinatorial Optimization 12 (3) : 303 ~ 323 [2006]
  • Peterson Graph
    E. W. Weisstein Mathworld
  • Karp's 21 NP-complete Problems
  • Finding Clique Using Backtracking Algorithm
    H. J. Kim University of Washington [2006]
  • ESI 6448 Discrete Optimization Theory: Cliques, Quasi-cliques and Clique Partitions in Graphs
    P. M. Pardalos Department of Industrial and Systems Engineering, University of Florida [2008]
  • Dynamic Local Search for the Maximum Clique Problem
    W. Pullan Journal of Artificial Intelligence Research 25 (1) : 159 ~ 185 [2006]
  • Degree (Graph Theory)
  • DNA Solution of the Maximal Clique Problem
    Q. Ouyang Science 278 : 446 ~ 449 [1997]
  • Cooperating Local Search for the Maximum Clique Problem
    W. Pullan Journal of Heuristics 17 (2) : 181 ~ 199 [2011]
  • Complete Graph
    E. W. Weisstein Mathworld
  • Clique (Graph Theory)
  • Clique
    Y. D. Lyuu Dept. of Computer Science & Information Engineering, National Taiwan University [2004]
  • CS21: Decidability and Tractability
    C. Umans [2009]
  • Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination
    K. Xu [2009]
  • An Improved Branch and Bound Algorithm for the Maximum Clique Problem
    J. Konc MATCH Communications in Mathematical and in Computer Chemistry 58 (3) : 569 ~ 590 [2007]
  • 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 Note on Finding a Maximum Clique in a Graph Using BDDs
    Mukul S. Bansal Australasian Journal of Combinatorics 32 (1) : 253 ~ 258 [2005]
  • A New Effective Local Search Heuristic for the Maximum Clique Problem
    S. Balaji World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical and Quantum Engineering 7 (5) : 523 ~ 529 [2013]
  • A Local Search Algorithm for the Maximum Clique Problem
    L. Xiangmei Journal of Convergence Information Technology 7 (14) : 65 ~ 70 [2012]
  • A Fast Algorithm for the Maximum Clique Problem
    P. R. J. Östergård Discrete Applied Mathematics 120 (1) : 197 ~ 207 [2002]