David S. Kung
DAC 1998
Paper
The greedy algorithm is optimal for on-line edge coloring
Related
Yao Qi, Raja Das, et al.
ISSTA 2009
Thomas M. Cover
IEEE Trans. Inf. Theory
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009