Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 333-344
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
Computing transparently: the independent sets in a graph
By Head Tom
Natural Computing, Vol. 10, Iss. 1, 2011-03 ,pp. :
Access to resources
Recommend
Independent minimum length programs to translate between given strings
By Vereshchagin N.K. Vyugin M.V.
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
By Li Changjun Luo M Ronnier Melgosa Manuel
Color and Imaging Conference, Vol. 2012, Iss. 1, 2012-01 ,pp. :
Partitioning vertices of 1-tough graphs into paths
By Bazgan C. Harkat-Benhamdine A. Li H. Wozniak M.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :