Partitioning planar graphs with vertex costs: Algorithms and applications
From MaRDI portal
Recommendations
Cited in
(16)- A quality and distance guided hybrid algorithm for the vertex separator problem
- The vertex separator problem: a polyhedral investigation
- Continuous quadratic programming formulations of optimization problems on graphs
- Partitioning planar graphs with costs and weights
- scientific article; zbMATH DE number 4064516 (Why is no real title available?)
- scientific article; zbMATH DE number 4101213 (Why is no real title available?)
- scientific article; zbMATH DE number 4101215 (Why is no real title available?)
- Finding Separator Cuts in Planar Graphs within Twice the Optimal
- Planar crossing numbers of graphs of bounded genus
- scientific article; zbMATH DE number 1926663 (Why is no real title available?)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- NP-completeness of the Planar Separator Problems
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Weighted graph separators and their applications
- On cleaving a planar graph
This page was built for publication: Partitioning planar graphs with vertex costs: Algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578391)