Author： Goles E. Rapaport I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.188, Iss.1, 1997-11, pp. : 129-159
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
Access to resources
Recommend
Complexity and algorithms for nonlinear optimization problems
Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. :
Complexity of path discovery game problems
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
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. :