Author： Yegnanarayanan V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 59-74
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
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Interval Partitions and Polynomial Factorization
By Gathen Joachim Panario Daniel Richmond Bruce
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Minimum Weight Convex Steiner Partitions
By Dumitrescu Adrian Tóth Csaba
Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. :
On-line chain partitions of orders
By Felsner S.
Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. :