Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference22 articles.
1. A study of non-blocking switching networks;Clos;Bell Syst. Tech. J.,1953
2. The greedy algorithm is optimal for on-line edge coloring;Bar-Noy;Inform. Process. Lett.,1992
3. I.R. Cohen, B. Peng, D. Wajc, Tight bounds for online edge coloring, in: Proc. of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS2019, 2019, pp. 1–25.
4. S. Bhattacharya, F. Grandoni, D. Wajc, Online edge coloring algorithms via the nibble method. In, in: Proc. of the ACM-SIAM Symposium on Discrete Algorithms, SODA2021, 2021, pp. 2830–2842.
5. A. Saberi, D. Wajc, The greedy algorithm is not optimal for on-line edge coloring, in: Proc. of the 48th International Colloquium on Automata, Languages, and Programming, Vol. 109, ICALP2021, 2021, pp. 1–109, 18.