Author:
Favrholdt Lene Monrad,Nielsen Morten Nyhave
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Lect Notes Comput Sci;Y. Azar,2000
2. Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251–253, 1992.
3. J. Boyar and K. S. Larsen. The seat reservation problem. Algorithmica, 25(4):403–417, 1999.
4. Lect Notes Comput Sci;J. Boyar,1999
5. Lene M. Favrholdt and Morten N. Nielsen. On-line edge-coloring with a fixed number of colors. Preprints 1999, no. 6, Department of Mathematics and Computer Science, University of Southern Denmark, Odense.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Wide-Sense Nonblocking WDM Cross-Connects;Algorithms — ESA 2002;2002
2. Approximating Maximum Edge Coloring in Multigraphs;Approximation Algorithms for Combinatorial Optimization;2002