I have to partition a graph which has more than 1 million vertexs. Each vertex has an own weight from 1 to 1 thousand. The link between vertexs is sparse,each link has a weight 1. Now I want to partition the graph into about 100 parts. Each part has about the same own weight.I want to make the whole link weight between each part be mini. Beside the FM,KL beside the FM,KL algorithm,who can give me some other idea?
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
