I have to implement a Greedy Edge Coloring Algorithm. The algorithm is called Greedy Independent Set algorithm and the only thing I know about it is that it uses matchings in graph. If somebody have implementation of it or maybe some pseidocode, please share with me.
Why was that easier than Googling it? Look: exactly what you want at the top hit (a Wikipedia article on the subject): http://lmgtfy.com/?q=Greedy+Edge+Coloring+Algorithm
