Partitioning Planar Graphs
From MaRDI portal
Publication:3990649
DOI10.1137/0221016zbMath0759.05089OpenAlexW2031579107MaRDI QIDQ3990649
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221016
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ⋮ Bisection of bounded treewidth graphs by convolutions ⋮ Parallel approximation schemes for problems on planar graphs ⋮ Minimum Bisection Is Fixed-Parameter Tractable ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Finding good approximate vertex and edge partitions is NP-hard ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs ⋮ Generating irregular partitionable data structures ⋮ Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
This page was built for publication: Partitioning Planar Graphs
