Author： Vereshchagin N.K. Vyugin M.V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.271, Iss.1, 2002-01, pp. : 131-143
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
Defining a Minimum Area Rectangle Circumscribing Given Information
By Doytsher Y.
The Cartographic Journal, Vol. 25, Iss. 2, 1988-12 ,pp. :
Access to resources
Recommend
Wide-diameter and minimum length of fan
Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. :
On the Number of t-Ary Trees with a Given Path Length
Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. :
Independent triangles covering given vertices of a graph
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Matching a set of strings with variable length don't cares
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :