The following pages link to Vertex Bisection is Hard, too (Q3184606):
Displaying 7 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- Isoperimetry in integer lattices (Q4645032) (← links)
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations (Q5228057) (← links)
- On minimum vertex bisection of random \(d\)-regular graphs (Q6564623) (← links)
