Pages that link to "Item:Q896191"

The following pages link to Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191):

Displaying 3 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)