iamzuma

Hello guys,

I'm wondering whether there exist algorithms

for solving selecting k nodes in a weighted graph G(V,E)

such that the weighting sum of the nodes and vertices

is maximized. Please help me if you have some clues.

Thank you very much.

P.S. NODE AND EDGE are both with positive weights, w(v) and

w(e). The subgraph can be connected (or not)

I'm wondering whether there exist algorithms

for solving selecting k nodes in a weighted graph G(V,E)

such that the weighting sum of the nodes and vertices

is maximized. Please help me if you have some clues.

Thank you very much.

P.S. NODE AND EDGE are both with positive weights, w(v) and

w(e). The subgraph can be connected (or not)