Pages that link to "Item:Q1322395"
From MaRDI portal
The following pages link to An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395):
Displayed 5 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- (Q5708519) (← links)