Author： Peng
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.240, Iss.2, 2000-06, pp. : 429-446
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
An Approximation Algorithm for Binary Searching in Trees
By Laber Eduardo Molinaro Marco
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
Access to resources
Recommend
A Distributed Algorithm for Computing the Node Search Number in Trees
By Coudert David Huc Florian Mazauric Dorian
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Approximating Node-Connectivity Augmentation Problems
By Nutov Zeev
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :