Implementing the topological model succinctly

DOI10.1007/978-3-030-32686-9_35MaRDI QIDQ6536274zbMATH OpenFDO

Authors José Fuentes-Sepúlveda, Gonzalo Navarro, Diego Seco

Publication date 19 April 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Navigating planar topologies in near-optimal space and time
• Succinct representations of planar maps
• Algorithms and Data Structures
• Succinct Representations of Arbitrary Graphs
• Succinct encoding of binary strings representing triangulations

Cites work

• Compressed representations of sequences and full-text indexes
• Distance oracles beyond the Thorup-Zwick bound
• Fast set intersection and two-patterns matching
• On the succinct representation of graphs
• Spanning trees of dual graphs
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Succinct representation of balanced parentheses and static trees

This page was built for publication: Implementing the topological model succinctly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536274)