Author： Kang L. Qiao H. Shan E. Du D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.296, Iss.1, 2003-03, pp. : 89-98
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
Treewidth Lower Bounds with Brambles
By Bodlaender Hans Grigoriev Alexander Koster Arie
Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. :
Lower bounds for asynchronous consensus
Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. :
Strong Minimax Lower Bounds for Learning
By Antos A.
Machine Learning, Vol. 30, Iss. 1, 1998-01 ,pp. :