Randomized path coloring on binary trees-Reference-Cited by-同舟云学术

Randomized path coloring on binary trees

Published:2002-10 Issue:1 Volume:289 Page:355-399
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Auletta Vincenzo,Caragiannis Ioannis,Kaklamanis Christos,Persiano Pino

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Weighted sums of certain dependent random variables;Azuma;Tohoku Math. J.,1967

2. I. Caragiannis, C. Kaklamanis, P. Persiano, Bounds on optical bandwidth allocation on directed fiber tree topologies, 2nd Workshop on Optics and Computer Science (WOCS ’97), 1997.

3. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations;Chernoff;Ann. Math. Statist.,1952

4. T. Erlebach, K. Jansen, Scheduling of virtual connections in fast networks, Proc. 4th Workshop on Parallel Systems and Algorithms, 1996, pp. 13–32.

5. T. Erlebach, K. Jansen, Call scheduling in trees, rings and meshes, Proc. 30th Hawaii Internat. Conf. on System Sciences, 1997.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Path Coloring on Binary Caterpillars;IEICE Transactions on Information and Systems;2006-06-01

2. Path problems in generalized stars, complete graphs, and brick wall graphs;Discrete Applied Mathematics;2006-03

3. Approximation Algorithms for Path Coloring in Trees;Lecture Notes in Computer Science;2006

4. Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees;Approximation and Online Algorithms;2004

5. Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks;Lecture Notes in Computer Science;2004