On the Problem of Partitioning Planar Graphs
From MaRDI portal
Publication:3968972
DOI10.1137/0603022zbMath0503.05057OpenAlexW2052056934MaRDI QIDQ3968972
Publication date: 1982
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0603022
Related Items
Graph separators: A parameterized view, Finding small simple cycle separators for 2-connected planar graphs, Network decontamination with a single agent, Ordered colourings, Collective tree spanners in graphs with bounded parameters, The analysis of a nested dissection algorithm, An application of the planar separator theorem to counting problems, Local optimization on graphs, On the discrepancies of graphs, Communication throughput of interconnection networks, On the negative cost girth problem in planar networks, Unnamed Item, Theory and application of width bounded geometric separators, Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées, Sublinear time width-bounded separators and their application to the protein side-chain packing problem, Formula dissection: A parallel algorithm for constraint satisfaction, Capture bounds for visibility-based pursuit evasion, Toric origami structures on quasitoric manifolds, New graph decompositions with applications to emulations, Grid spanners with low forwarding index for energy efficient networks, A Separator Theorem for Chordal Graphs, A PTAS for a disc covering problem using width-bounded separators, MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING, An algorithm for colouring perfect planar graphs, Short and Simple Cycle Separators in Planar Graphs
