<p>In a connected / undirected / node weighted (with both positive and negative weights) network, there are many papers studied about the 'Maximum weight connected subgraph' problem. But are there any algorithms (even heuristic) to find highly weighted (not necessarily maximum) subnetworks that are densely inter-connected? </p>

CC BY-SA 3.0
2015-02-23T12:15:34.253Z
You'll need to better define "highly weighted" and "densely inter-connected" to get meaningful answers.
R B
CC BY-SA 3.0
2015-02-23T16:44:07.880Z
In a connected, undirected, node-weighted network with non-negative weights one can just take the whole graph.  Are you allowing negative weights?  Further, is a bounded degree subgraph sufficiently interconnected, or is something like c-connectivity for small c enough?
András Salamon
<graph-algorithms>
Detect highly weighted but also densely inter-connected subnetworks
yliueagle
# Detect highly weighted but also densely inter-connected subnetworks

(Asked by: username_0 on 2015-02-23)

In a connected / undirected / node weighted (with both positive and negative weights) network, there are many papers studied about the 'Maximum weight connected subgraph' problem. But are there any algorithms (even heuristic) to find highly weighted (not necessarily maximum) subnetworks that are densely inter-connected?

**Tags:** graph-algorithms
> **Comments:**
> **username_1**: You'll need to better define "highly weighted" and "densely inter-connected" to get meaningful answers.  
> **username_2**: In a connected, undirected, node-weighted network with non-negative weights one can just take the whole graph.  Are you allowing negative weights?  Further, is a bounded degree subgraph sufficiently interconnected, or is something like c-connectivity for small c enough?  

---

## 0 answers

