Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.271, Iss.1, 2002-01, pp. : 37-46
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
The complexity of pursuit on a graph
By Goldstein A.S. Reingold E.M.
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
The Complexity of Bottleneck Labeled Graph Problems
By Hassin Refael Monnot Jérôme Segev Danny
Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. :
On the computational complexity of dynamic graph problems
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
On the Complexity of Function Learning
By Auer P.
Machine Learning, Vol. 18, Iss. 2-3, 1995-02 ,pp. :