Succinct preferential-attachment graphs

DOI10.1007/978-3-032-11835-6_20MaRDI QIDQ7294437zbMATH OpenFDO

Authors Ziad Ismaili Alaoui, Kumari Namrata, Sebastian Wild

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_20

Mathematics Subject Classification ID

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

Cites work

• A Comparison of Empirical Tree Entropies
• A general model of web graphs
• Asymmetry and structural information in preferential attachment graphs
• Compression and symmetry of small-world graphs and structures
• Compression of dynamic graphs generated by a duplication model
• Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
• Emergence of Scaling in Random Networks
• Geometric inhomogeneous random graphs
• GLOUDS: representing tree-like graphs
• scientific article; zbMATH DE number 7765383 (Why is no real title available?)
• scientific article; zbMATH DE number 7740925 (Why is no real title available?)
• Opportunistic data structures with applications
• Representing trees of higher degree
• Succinct data structures for bounded clique-width graphs
• Succinct data structures for chordal graphs
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• Succinct encodings for families of interval graphs
• Succinct navigational oracles for families of intersection graphs on a circle
• Succinct ordinal trees with level-ancestor queries
• Succinct permutation graphs
• Ultra-succinct representation of ordered trees with applications
• Wavelet trees for all

This page was built for publication: Succinct preferential-attachment graphs

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