The following pages link to Partitioning Planar Graphs (Q3990649):
Displaying 11 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Finding good approximate vertex and edge partitions is NP-hard (Q1198051) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5075784) (← links)
- (Q5092387) (← links)
