The following pages link to Partitioning Planar Graphs (Q3990649):
Displaying 22 items.
- A plane graph representation of triconnected graphs (Q410724) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Finding good approximate vertex and edge partitions is NP-hard (Q1198051) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- Subdivisions in planar graphs (Q1366603) (← 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)
- On alliance partitions and bisection width for planar graphs (Q2865020) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- (Q3819101) (← links)
- (Q3826577) (← links)
- (Q4232783) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5075784) (← links)
- (Q5092387) (← links)
- (Q5284057) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)
