Pages that link to "Item:Q5859000"

The following pages link to On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000):

Displaying 8 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
• Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
• (Q5053193) (← links)
• On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)