Pages that link to "Item:Q1198051"
From MaRDI portal
The following pages link to Finding good approximate vertex and edge partitions is NP-hard (Q1198051):
Displayed 3 items.
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
- Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm (Q6173938) (← links)