A practical succinct data structure for tree-like graphs

DOI10.1007/978-3-319-15612-5_7MaRDI QIDQ5176573zbMATH OpenOpenAlexFDO

Authors

Publication date 27 February 2015

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15612-5_7

Mathematics Subject Classification ID

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

Recommendations

• GLOUDS: representing tree-like graphs
• Fully-functional succinct trees
• Succinct Trees in Practice
• Simple and efficient fully-functional succinct trees
• A practical succinct dynamic graph representation

Cited in

(5)

• A practical succinct dynamic graph representation
• GLOUDS: representing tree-like graphs
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• Succinct Data Structures for Path Queries
• Succinct data structure for dynamic trees with faster queries

This page was built for publication: A practical succinct data structure for tree-like graphs

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