Author： Dankelmann Peter Hattingh Johannes Henning Michael Swart Henda
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.34, Iss.4, 2006-04, pp. : 597-607
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Lower bounds on the minus domination and k-subdomination numbers
By Kang L. Qiao H. Shan E. Du D.
Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. :
Access to resources
Recommend
By Gravier S. Mhalla M. Tannier E.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Efficient minus and signed domination in graphs
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
By Alber Jochen
Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. :
The greedy algorithm for domination in graphs of maximum degree 3
By Seager S.M.
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :