Pages that link to "Item:Q2877347"
From MaRDI portal
The following pages link to Efficient polynomial-time algorithms for special graph partitioning problems (Q2877347):
Displaying 4 items.
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963) (← links)