Pages that link to "Item:Q5919045"

The following pages link to Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045):

Displayed 2 items.

• New algorithms for a simple measure of network partitioning (Q2700788) ‎ (← links)
• New algorithms for a simple measure of network partitioning (Q6111946) ‎ (← links)