Compression of dynamic graphs generated by a duplication model

DOI10.1007/S00453-020-00699-2zbMath1453.68075OpenAlexW3014396007MaRDI QIDQ2196614

Wojciech Szpankowski, Krzysztof Turowski, Abram Magner

Publication date: 3 September 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00699-2

zbMATH Keywords

random graphsgraph compressionstructural entropyduplication model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (1)

Towards degree distribution of a duplication-divergence graph model

Cites Work

• Evolving protein interaction networks through gene duplication
• Introduction to Random Graphs
• A Universal Grammar-Based Code for Lossless Compression of Binary Trees
• Statistical mechanics of complex networks
• GROWING HIERARCHICAL SCALE-FREE NETWORKS BY MEANS OF NONHIERARCHICAL PROCESSES
• Entropy and Optimal Compression of Some General Plane Trees
• Lossless Compression of Binary Trees With Correlated Vertex Names
• Asymmetry and structural information in preferential attachment graphs
• Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
• Elements of Information Theory
• Univariate Discrete Distributions
• Networks

This page was built for publication: Compression of dynamic graphs generated by a duplication model