A practical succinct dynamic graph representation

DOI10.1016/J.IC.2021.104862zbMATH Open1489.68059OpenAlexW4200107410MaRDI QIDQ2672244FDOQ2672244

Authors: Miguel E. Coimbra, Joana Hrotkó, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro 

Publication date: 8 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104862

Recommendations

• A practical succinct data structure for tree-like graphs
• Representing dynamic binary trees succinctly
• Succinct representation of dynamic trees
• Fully-functional succinct trees
• An Improved Succinct Representation for Dynamic k-ary Trees

zbMATH Keywords

dynamic graphs\(k^2\)-treecompact graph representationsgraph library

Mathematics Subject Classification ID

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

Cited In (6)

• Difference Map Readability for Dynamic Graphs
• A practical succinct data structure for tree-like graphs
• Compression of dynamic graphs generated by a duplication model
• Faster dynamic compressed \(d\)-ary relations
• Faster compressed quadtrees
• Fully dynamic representations of interval graphs

Uses Software

• igraph
• WebGraph

This page was built for publication: A practical succinct dynamic graph representation

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