Pages that link to "Item:Q673224"
From MaRDI portal
The following pages link to Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224):
Displayed 6 items.
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- (Q5708519) (← links)