I/O-Efficient Planar Separators
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)
Recommendations
- scientific article; zbMATH DE number 2119685
- Planar Separators
- Algorithms – ESA 2005
- Engineering planar separator algorithms
- Space efficient separator algorithms for planar graphs
- I/O-efficient well-separated pair decomposition and applications
- An optimal parallel algorithm for planar cycle separators
- Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
- I/O-efficient algorithms on near-planar graphs
- I/O-Efficient Algorithms on Near-Planar Graphs
Cited in
(12)- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
- Compact I/O-efficient representation of separable graphs and optimal tree layouts
- I/O-efficient well-separated pair decomposition and applications
- On external-memory MST, SSSP and multi-way planar graph separation
- Via Detours to I/O-Efficient Shortest Paths
- On External-Memory Planar Depth First Search
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
- scientific article; zbMATH DE number 2119685 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
- I/O-efficient algorithms on near-planar graphs
- I/O-Efficient Algorithms on Near-Planar Graphs
This page was built for publication: I/O-Efficient Planar Separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631891)
