A Dominating Set Algorithm

@inproceedings{Lee2013ADS,
  title={A Dominating Set Algorithm},
  author={Sang-un Lee},
  year={2013}
}
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  with maximum degree among vertices adjacent to the vertex  with minimum degree  to Minimum Independent DS (MIDS) as its element and removing all the incident… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Dominating Set

Wikipedia
  • http://en.wikipedia. org/wiki/Dominating_set, 2013.
  • 2013
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Wireless CommunicationOptimization

C. W. Yi
  • Dept. of Computer Science, National Chiao Tung University, 2008. 저 자 소 개 이 상 운(Sang-Un, Lee) 1983년~1987년 : 한국항공대학교항공전자공학과 (학사) 1995년~1997년 : 경상대학교컴퓨터과학과 (석사) 1998년~2001년 : 경상대학교컴퓨터과학과 (박사) 2003.3~현재 : 강릉원주대학교멀티미디어공학과부교수 관심분야 : 소프트웨어프로젝트관리, 소프트웨어개발방법론, 소프트웨어신뢰성, 그래프알고리즘 e-mail : sulee@gwnu.ac.kr
  • 2008
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

  • IEEE Transactions on Mobile Computing
  • 2007
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A note on the complexity of minimum dominating set

  • J. Discrete Algorithms
  • 2006
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

  • IEEE Transactions on Parallel and Distributed Systems
  • 2006
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…