연구동향 분석

최소차수 정점을 이용한 도메틱 수 알고리즘

이상운(Sang-Un Lee) 2015년

논문상세정보
인용/피인용
' 최소차수 정점을 이용한 도메틱 수 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 전산공학
  • adjacent
  • degree
  • domaticnumber
  • dominatingset
  • neighborhood
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
629 0

0.0%

' 최소차수 정점을 이용한 도메틱 수 알고리즘' 의 참고문헌

  • 최소 차수 정점에 인접한 최대 차수 정점 선택 방법을 적용한 정점 최소 지배집합 알고리즘
    이상운 한국정보기술학회논문지 11 (11) : 37 ~ 44 [2013]
  • Two Families of NP-Complete Problems
    M. Pei University of Waterloo [2003]
  • The Domatic Number of Regular Graphs
  • The Domatic Number Problem on Some Perfect Graph Families
    H. Kaplan [1995]
  • Remarks about Disjoint Dominating Sets
  • On The Domatic Number of Bipartite Permutation Graphs
  • Maximizing the Lifetime of Dominating Sets
    T. Moscibroda Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium : 1 ~ 8 [2005]
  • Island Network Analysis: MSTs and Dominating Sets
    A. Desrochers Saint Michael's College [2004]
  • Fundamentals of Domination in Graphs: Introduction to Domination Theory
    S. T. Hedetniemi Marcel Dekker, Inc. [1998]
  • Extending he Lifetime of Wireless Networks While Ensuring Coverage
  • Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy
    J. Rothe [2005]
  • Dominating Set
    Wikipedia Wikimedia Foundation Inc [2014]
  • Domatic Number
    Wikipedia Wikimedia Foundation Inc. [2014]
  • Connected Domatic Number in Planar Graphs
    B. L. Hartnell Czechoslovark Mathematical Journal 51 (126) : 173 ~ 179 [2001]
  • Computers and Intractability: A Guide to the Theory of NPCompleteness
    M. Garey W. H. Freeman [1979]
  • Complexity of the Exact Domatic Number Problem and of the Exact Conveyer Flow Shop Problem
    T. Riege [2004]
  • A Note on the Complexity of Minimum Dominating Set
    F. Grandoni Journal of Discrete Algorithms 4 (2) : 209 ~ 214 [2006]
  • A New Optimality Measure for Distance Dominating Sets
    N. Simjour University of Waterloo [2006]
  • A Key-Predistribution-Based Weakly Connected Dominating Set for Secure Clustering in DSN, Proceedings of Second International Conference on High Performance Computing and Communications
    A. S. K. Pathan Lecture Notes in Computer Science 4208 : 270 ~ 279 [2006]
  • A Greedy Approximation for Minimum Connected Dominating Sets
    L. Ruan Theoretical Computer Science 329 (1-3) : 325 ~ 330 [2004]