finding all the paths is crazy)) in worst case you get about n! paths. But even having all the paths, it is not clear how you can find out if there are k of them sharing no vertex. It is sort of set covering problem that is not very easy by itself.
--~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
