Author： Shahrokhi F. Sykora O. Szekely L.A. Vrt'o I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.245, Iss.2, 2000-08, pp. : 281-294
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
Martin's game: a lower bound for the number of sets
By Ageev M.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
A new lower bound for the open-shop problem
Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. :
A new lower bound for the list update problem in the partial cost model
By Ambuhl C. Gartner B. von Stengel
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. :