Click here to Skip to main content
11,575,882 members (53,494 online)
Rate this: bad
Please Sign up or sign in to vote.
See more: C++
The problem of partitioning graphs into equalsized components while minimizing the capacity of the edges cut.And the minimum biesection problem is partitioning a graph into two part and minimizing the capacity of the edges cut.I know this problem is an NPC problem and there already have some relevant proves.But most of these proves I have searched do not considered the weight of the node(or the size of the node),so what I want to ask is that is there anybody who once have seen relevant proves which have considered the weight of the node?

If you know,please give me a link or tell me how to search it,Thanks~
Posted 30-Mar-12 1:54am

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
0 Sergey Alexandrovich Kryukov 390
1 Dave Kreskowiak 204
2 F-ES Sitecore 135
3 OriginalGriff 125
4 Abhinav S 98
0 OriginalGriff 705
1 Sergey Alexandrovich Kryukov 600
2 Abhinav S 438
3 F-ES Sitecore 400
4 Suvendu Shekhar Giri 365

Advertise | Privacy | Mobile
Web04 | 2.8.150624.2 | Last Updated 30 Mar 2012
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100