Author： Fomin Fedor V. Heggernes Pinar Telle Jan Arne
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.41, Iss.2, 2004-11, pp. : 73-87
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On the bandwidth of a Hamming graph
By Harper L.H.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Access to resources
Recommend
The cost of monotonicity in distributed graph searching
Distributed Computing, Vol. 22, Iss. 2, 2009-10 ,pp. :
Edge and node searching problems on trees
By Peng
Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. :
An Approximation Algorithm for Binary Searching in Trees
By Laber Eduardo Molinaro Marco
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :