The greedy algorithm is optimal for on-line edge coloring

From MaRDI portal
Publication:1209350

DOI10.1016/0020-0190(92)90209-EzbMath0768.68117WikidataQ56390611 ScholiaQ56390611MaRDI QIDQ1209350

Amotz Bar-Noy, Joseph (Seffi) Naor

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)




Related Items (14)




Cites Work




This page was built for publication: The greedy algorithm is optimal for on-line edge coloring