Short and simple cycle separators in planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- scientific article; zbMATH DE number 3752239 (Why is no real title available?)
- scientific article; zbMATH DE number 1926663 (Why is no real title available?)
- A Separator Theorem for Nonplanar Graphs
- A Separator Theorem for Planar Graphs
- A Theorem on Planar Graphs
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- A linear-time algorithm to find a separator in a graph excluding a minor
- A separator theorem for graphs of bounded genus
- Applications of a Planar Separator Theorem
- Efficiency of a Good But Not Linear Set Union Algorithm
- Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
- Engineering planar separator algorithms
- Exact distance oracles for planar graphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Faster shortest-path algorithms for planar graphs
- Finding small simple cycle separators for 2-connected planar graphs
- Improved algorithms for \textsc{Min-cut} and \textsc{Max-flow} in undirected planar graphs
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
- Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- Many distances in planar graphs
- Min-cuts and shortest cycles in planar graphs in O(n n) time
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
- Non-Separable and Planar Graphs
- On the Problem of Partitioning Planar Graphs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Planar separators and parallel polygon triangulation.
- Reduced constants for simple cycle graph separation
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
- Short and simple cycle separators in planar graphs
- Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
- Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
- Structured recursive separator decompositions for planar graphs in linear time
Cited in
(11)- Structured recursive separator decompositions for planar graphs in linear time
- Finding small simple cycle separators for 2-connected planar graphs
- scientific article; zbMATH DE number 4135967 (Why is no real title available?)
- scientific article; zbMATH DE number 7286697 (Why is no real title available?)
- Balanced line separators of unit disk graphs
- Algorithms – ESA 2005
- Finding short cycles in planar graphs using separators
- Not all planar digraphs have small cycle separators
- Short and simple cycle separators in planar graphs
- Engineering planar separator algorithms
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
This page was built for publication: Short and simple cycle separators in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266605)
