|Jan8-11, 01:16 AM||#1|
does anyone know of any greedy or suboptimal algorithm to obtain harmonious coloring on a graph?
|Jan8-11, 04:46 AM||#2|
what exactly do u want to use it for?
|Jan9-11, 06:17 PM||#3|
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.
|Similar Threads for: Harmonious coloring|
|The rights to be harmonious||Current Events||82|
|Coloring SEM and TEM images||Atomic, Solid State, Comp. Physics||3|
|Coloring In Powerade.||Biology||13|