Browse > Article
http://dx.doi.org/10.9708/jksci.2013.18.9.121

A Dominating Set Algorithm  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
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.
Keywords
Dominating Set; Connected DS; Independent DS; Degree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Morgan and V. Grout, "Optimisaion Techniques for Wireless Networks," Proceedings of 6th International Network Conference (INC 2006), pp. 339-346, Jul. 2006.
2 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.
3 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.
4 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.
5 C. W. Yi, "Wireless Communication Optimization," Dept. of Computer Science, National Chiao Tung University, 2008.
6 F. Grandoni, "A Note on the Complexity of Minimum Dominating Set," Journal of Discrete Algorithms, Vol. 4, No. 2, pp. 209-214, Jun. 2006.   DOI   ScienceOn
7 Y. Li, "Connected Dominating Sets in Wireless Networks," http;//www.cs.umn.edu/research/mobile/seminar/SPRING04/WNfiles/p3.ppt, 2004.
8 A. Schumacher, "Dominating-set-based Routing in AdHoc Networks," http://www.cs.helsinki.fi/u/floreen/adhoc/schumacher_slides.pdf, 2003
9 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.   DOI   ScienceOn
10 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
11 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.
12 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.
13 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.   DOI   ScienceOn
14 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.   DOI   ScienceOn
15 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.
16 A. Desrochers, "Island Network Analysis: MSTs and Dominating Sets," Dept. of Mathematics, Saint Michael's College, Winooski Park Colchester, 2004.
17 Wikipedia, "Dominating Set," http://en.wikipedia.org/wiki/Dominating_set, 2013.
18 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.   DOI   ScienceOn
19 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.
20 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.
21 M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman, 1979.
22 M. Pei, "Two Families of NP-Complete Problems," University of Waterloo, http://www.math.uwaterloo.ca/-mpei/mds.pdf, 2003.