The following pages link to Finding dense subgraphs (Q6487951):
Displaying 12 items.
- Dense and sparse graph partition (Q714027) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Dense Induced Subgraphs of Dense Bipartite Graphs (Q4986805) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- The dense \(k\)-subgraph problem (Q5930156) (← links)