On the Problem of Partitioning Planar Graphs
From MaRDI portal
Cited in
(25)- Finding small simple cycle separators for 2-connected planar graphs
- The analysis of a nested dissection algorithm
- An application of the planar separator theorem to counting problems
- Local optimization on graphs
- An algorithm for colouring perfect planar graphs
- Graph separators: A parameterized view
- Ordered colourings
- On the discrepancies of graphs
- A PTAS for a disc covering problem using width-bounded separators
- Network decontamination with a single agent
- A Separator Theorem for Chordal Graphs
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- É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
- Capture bounds for visibility-based pursuit evasion
- Toric origami structures on quasitoric manifolds
- Communication throughput of interconnection networks
- Short and simple cycle separators in planar graphs
- scientific article; zbMATH DE number 7651159 (Why is no real title available?)
- Grid spanners with low forwarding index for energy efficient networks
- Theory and application of width bounded geometric separators
- New graph decompositions with applications to emulations
- Collective tree spanners in graphs with bounded parameters
- On the negative cost girth problem in planar networks
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- Formula dissection: A parallel algorithm for constraint satisfaction
This page was built for publication: On the Problem of Partitioning Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968972)
