Given a undirect graph G=(N, E) a two colour scheme assigns to each node either the colour black or white. A node is diverse if it has the opposite colour of at least half of its neighbours. How can you assign a diverse colour to all the nodes in a graph?
I/Overload? - [image: i-overload]Did Google's conference succeed? It launched dozens of products in its 205 minute keynote, but did the world understand them? I saw some...
25 minutes ago