Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Dominating Set Algorithm

지배집합 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2013.07.30
  • Accepted : 2013.08.27
  • Published : 2013.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

본 논문은 아직까지 정확한 해를 다항시간으로 구하는 알고리즘이 존재하지 않아 NP-완전 문제로 알려진 지배집합 (DS) 문제의 정확한 해를 선형시간으로 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 그래프의 간선이 존재하지 않을 때까지 최소차수 ${\delta}(G)$를 가진 정점 u의 인접정점들 중 최대차수 ${\Delta}(G)$를 가진 정점 v를 최소 독립지배집합(MIDS)의 원소로 포함시키고 v의 부속 간선을 삭제하는 방법을 반복적으로 수행하여 구하였다. MIDS로부터 최소 지배집합 (MDS)으로 변환시키고, MDS로부터 최소연결 DS (MCDS)로 변환시키는 방법으로 DS 관련 모든 문제의 정확한 해를 구할 수 있었다. 제안된 알고리즘을 10개의 다양한 그래프에 적용한 결과 정확한 해를 선형 시간복잡도 O(n)으로 구하는데 성공하였다. 결국, 제안된 지배집합 알고리즘은 지배집합 문제가 P-문제임을 증명하였다.

Keywords

References

  1. Wikipedia, "Dominating Set," http://en.wikipedia.org/wiki/Dominating_set, 2013.
  2. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K. I. Ko, "A Greedy Approximation for Minimum Connected Dominating Sets," Theoretical Computer Science, Vol. 329, No. 1-3, pp. 325-330, Dec. 2004. https://doi.org/10.1016/j.tcs.2004.08.013
  3. M. A. Henning, C. L"owenstein, andD. Rautenbach, "Remarks about Disjoint Dominating Sets," http://www.tu-ilmenau.de/fakmn/fileadmin/templete/fm/Preprints/Rautenbach/08_09_Rauten bach.pdf, 2008.
  4. A. Desrochers, "Island Network Analysis: MSTs and Dominating Sets," Dept. of Mathematics, Saint Michael's College, Winooski Park Colchester, 2004.
  5. A. S. K. Pathan and C. S. Hong, "A Key-Predistribution -Based Weakly Connected Dominating Set for Secure Clustering in DSN," IEEEInternational Conference onHigh Performance Computing and Communications (HPCC), Lecture Notes in Computer Science, Vol. 4208, pp. 270-279, Sep. 2006.
  6. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman, 1979.
  7. M. Pei, "Two Families of NP-Complete Problems," University of Waterloo, http://www.math.uwaterloo.ca/-mpei/mds.pdf, 2003.
  8. F. Grandoni, "A Note on the Complexity of Minimum Dominating Set," Journal of Discrete Algorithms, Vol. 4, No. 2, pp. 209-214, Jun. 2006. https://doi.org/10.1016/j.jda.2005.03.002
  9. Y. Li, "Connected Dominating Sets in Wireless Networks," http;//www.cs.umn.edu/research/mobile/seminar/SPRING04/WNfiles/p3.ppt, 2004.
  10. A. Schumacher, "Dominating-set-based Routing in AdHoc Networks," http://www.cs.helsinki.fi/u/floreen/adhoc/schumacher_slides.pdf, 2003
  11. W. C. K. Yen, "Bottleneck Domination and Bottleneck Independent Domination on Graphs," Journal of Information and Engineering, Vol. 18, No. 2, pp. 311-331, Mar. 2002
  12. I. J. Dejter and O. Serra, "Efficient Dominating Sets in Cayley Graphs," Discrete Applied Mathematics, Vol. 129, No. 2-3, pp. 319-328, Aug. 2003. https://doi.org/10.1016/S0166-218X(02)00573-5
  13. V. N. Raghavan, A. Ranganath, R. N. Bharath, and M. F. Khan, "Simple and Efficient Backbone Algorithm for Calculating Connected Dominating Set in Wireless Adhoc Networks," International Journal of Electrical and Computer Engineering, Vol. 2, No. 11, pp. 732-739, Feb. 2007.
  14. Y. P. Chen and A. L. Liestman, "Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks," Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing and Computing (MOBIHOC'02), pp. 165-172, 2002.
  15. Y. P. Chen and A. L. Liestman, "Maintaining Weakly-connected Dominating Sets for Clustering Ad Hoc Networks," Ad Hoc Networks, Vol. 3, No. 5, pp. 629-642, Sep. 2005. https://doi.org/10.1016/j.adhoc.2004.08.009
  16. J. Wu, M. Cardei, F. Dai, and S. Yang, "Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication," Trans. on Parallel and Distributed Systems, Vol. 17, No. 8, pp. 1-14, Aug. 2006. https://doi.org/10.1109/TPDS.2006.9
  17. J. Wu and H. Li, "Domination and It's Application in Ad Hoc Wireless Networks with Undirectional Links," International Conference on Parallel Processing, pp. 189-197, Aug. 2000.
  18. M. Morgan and V. Grout, "Optimisaion Techniques for Wireless Networks," Proceedings of 6th International Network Conference (INC 2006), pp. 339-346, Jul. 2006.
  19. S. Butenko, X. Cheng, C. A. S. Oliveira, and P. M. Pardolos, "A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks," Recent Developments in Cooperative Control and Optimization, Kluwer Academic Publishers, pp. 61-73, 2003.
  20. J. Wu and W. Lou, "Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs," Annual IEEE Communications Society Conference on Sensor and AdHoc Communications and Networks, pp. 621-630, Oct. 2004.
  21. A. Wiese and E. Kranakis, "Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs," School of Computer Science, CarletonUniversity, TR-07-17, 2007.
  22. C. W. Yi, "Wireless Communication Optimization," Dept. of Computer Science, National Chiao Tung University, 2008.