Harmonious Coloring: Greedy & Suboptimal Algos

[bob j]

Hi All,
does anyone know of any greedy or suboptimal algorithm to obtain harmonious coloring on a graph?

 

[sachinism]

what exactly do u want to use it for?

 

[mXSCNT]

Sure, you could easily imagine a greedy suboptimal algorithm. Start with a connected graph where all nodes are colorless but one, which has color 1. Maintain a list of color pairs that have already been used. At every step, color a node which is adjacent to a previous node, using an existing color if possible, otherwise using a new color. Continue until all nodes are colored.