Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 271-284
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
Efficient minus and signed domination in graphs
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Access to resources
Recommend
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. :
On congruences of automata defined by directed graphs
By Kelarev A.V. Sokratova O.V.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
On Independent Sets and Bicliques in Graphs
By Gaspers Serge Kratsch Dieter Liedloff Mathieu
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :