Author： Erlebach T. Jansen K. Kaklamanis C. Mihail M. Persiano P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 119-137
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
On-line matching routing on trees
Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. :
Access to resources
Recommend
By Blanchard G. Schäfer C. Rozenholc Y. Müller K.-R.
Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. :
By Nagaraj S.V.
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Optimal Broadcasting in Faulty Trees
Journal of Parallel and Distributed Computing, Vol. 60, Iss. 5, 2000-05 ,pp. :
Finding optimal paths in MREP routing
By Fleischer R. Golin M. Lea C.-T. Wong S.
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :