Pages that link to "Item:Q3000501"
From MaRDI portal
The following pages link to The Complexity Status of Problems Related to Sparsest Cuts (Q3000501):
Displaying 4 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP (Q5171219) (← links)
- The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)