Pages that link to "Item:Q5228503"

The following pages link to Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503):

Displaying 2 items.

• The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
• In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)