Hmm I've done something with graph coloring some time ago.You can check my blog entry: http://halfas.blogspot.com/2008/01/repost-my-discrete-mathematics-term.html <http://halfas.blogspot.com/2008/01/repost-my-discrete-mathematics-term.html>and if you feel that I can help you, please contact me.
Regards, Lukas. On Wed, Oct 7, 2009 at 11:07 AM, ankur aggarwal <ankur.mast....@gmail.com>wrote: > Given a graph.. > > Find the minimum number of coloring (Marking) required to node such that > every node in the final graph is connected by at least one of the > colored(marked) node. > > ex: > AB > AC > BD > BE > CF > > sol: 2 nodes to be colored. > > i.e. Colouring C and B would suffice.. > > > > -- You can contact me by : Home page: http://halfas.boom.lt Blog: http://halfas.boom.lt/blog --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---