Pages that link to "Item:Q493645"
From MaRDI portal
The following pages link to On the parameterized complexity of computing balanced partitions in graphs (Q493645):
Displaying 8 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- On minimum vertex bisection of random \(d\)-regular graphs (Q6564623) (← links)