Pages that link to "Item:Q1799206"
From MaRDI portal
The following pages link to The densest subgraph problem with a convex/concave size function (Q1799206):
Displaying 10 items.
- The density maximization problem in graphs (Q386420) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Density Functions subject to a Co-Matroid Constraint. (Q2957497) (← links)
- Dense subgraph problems with output-density conditions (Q4962748) (← links)
- Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
- Covering a graph with densest subgraphs (Q6659505) (← links)