Author： Tohyama H. Adachi A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 381-406
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
Complexity of tile rotation problems
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Access to resources
Recommend
Shortest Path Problems on a Polyhedral Surface
Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. :
Complexity and algorithms for nonlinear optimization problems
Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,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. :