The following pages link to Greedily finding a dense subgraph (Q5054810):
Displaying 8 items.
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- (Q2753729) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Greedily Finding a Dense Subgraph (Q4943076) (← links)
- Extracting brain disease‐related connectome subgraphs by adaptive dense subgraph discovery (Q6055706) (← links)