Oliver Bodemer
IBM J. Res. Dev
Paper
The greedy algorithm is optimal for on-line edge coloring
Abstract
No abstract available.
Related
Elliot Linzer, M. Vetterli
Computing
Limin Hu
IEEE/ACM Transactions on Networking
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM