Pages that link to "Item:Q5918819"
From MaRDI portal
The following pages link to Approximation algorithms for maximally balanced connected graph partition (Q5918819):
Displaying 12 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges (Q4606320) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
