special minimum bisection problem NP-Complete

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~