Pages that link to "Item:Q6102859"
From MaRDI portal
The following pages link to Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859):
Displaying 3 items.
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Partitioning graphs on message-passing machines by pairwise mincut (Q1818794) (← links)
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization (Q3060790) (← links)