Pages that link to "Item:Q6166191"
From MaRDI portal
The following pages link to Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191):
Displaying 7 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- (Q4980455) (← links)
- LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS (Q5100179) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)