LOL search for dominance in graph. 2009/10/7 ankur aggarwal <ankur.mast....@gmail.com>
> 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 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 -~----------~----~----~----~------~----~------~--~---
