Pages that link to "Item:Q997070"
From MaRDI portal
The following pages link to Bisecting a 4-connected graph with three resource sets (Q997070):
Displaying 4 items.
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315) (← links)
- Convex embeddings and bisections of 3-connected graphs (Q1410408) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)