Pages that link to "Item:Q5228503"
From MaRDI portal
The following pages link to Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503):
Displaying 4 items.
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)