The following pages link to In search of the densest subgraph (Q2005555):
Displaying 14 items.
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- A general tractable density concept for graphs (Q943001) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques (Q1755625) (← links)
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- (Q6065417) (← links)
- Targeting in networks under costly agreements (Q6102573) (← links)
