Succinct planar encoding with minor operations
From MaRDI portal
Cites work
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Contracting a planar graph efficiently
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- scientific article; zbMATH DE number 2185626 (Why is no real title available?)
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- scientific article; zbMATH DE number 7788635 (Why is no real title available?)
- Multistage graph problems on a global budget
- On the succinct representation of graphs
- Orderly spanning trees with applications to graph encoding and graph drawing
- Paths, Trees, and Flowers
- Planar separators and parallel polygon triangulation.
- Positive-instance driven dynamic programming for treewidth
- Short encodings of planar graphs and maps
- Space-efficient basic graph algorithms
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Space-efficient graph coarsening with applications to succinct planar encodings
- Space-efficient plane-sweep algorithms
- Space-efficient vertex separators for treewidth
- Space-efficient, fast and exact routing in time-dependent road networks
- Structured recursive separator decompositions for planar graphs in linear time
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct planar encoding with minor operations
- Succinct representation of balanced parentheses and static trees
- Succinct representations of separable graphs
Cited in
(2)
This page was built for publication: Succinct planar encoding with minor operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953171)
