Pages that link to "Item:Q6102278"
From MaRDI portal
The following pages link to Approximation and parameterized algorithms for balanced connected partition problems (Q6102278):
Displaying 9 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)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)