Constrained bipartite edge coloring with applications to wavelength routing-Reference-Cited by-同舟云学术

Constrained bipartite edge coloring with applications to wavelength routing

Published:1997 Issue: Volume: Page:493-504
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Kaklamanis Christos,Persiano Pino,Erlebach Thomas,Jansen Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63165-8_205.pdf

Reference12 articles.

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Shieber, and M. Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks, in Proc. of SODA 93.

2. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph Problems arising from Wavelength-Routing in All-Optical Networks, in proc. of Workshop on Optics in Computer Science, 1997.

3. C. Berge, Graphs, North-Holland.

4. J.-C. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, and U. Vaccaro, Efficient Collective Communication in Optical Networks, in Proc. of ICALP 96.

5. P. E. Green, Fiber Optic Communication Networks, Prentice Hall, 1992.

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

1. A $$\frac{5}{2}$$-approximation algorithm for coloring rooted subtrees of a degree 3 tree;Journal of Combinatorial Optimization;2020-04-09

2. Bibliography;Optical Networks;2010

3. WDM Network Design;Optical Networks;2010

4. Approximate constrained bipartite edge coloring;Discrete Applied Mathematics;2004-09

5. Paths Coloring Algorithms in Mesh Networks;Discrete Mathematics and Theoretical Computer Science;2003