![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Lu C.L. Peng S. Tang C.Y.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 381-397
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Parallel complexity of signed graphs for gene assembly in ciliates
By Harju Tero Li Chang Petre Ion
Soft Computing, Vol. 12, Iss. 8, 2008-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :