Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

DOI10.1109/TIT.2011.2173710MaRDI QIDQ5272095zbMATH OpenFDO

Authors Yongwook Choi, Wojciech Szpankowski

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2011.2173710

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15)

Cited in

(11)

• Shotgun assembly of unlabeled Erdős-Rényi graphs
• FCA in a logical programming setting for visualization-oriented graph compression
• On symmetry of uniform and preferential attachment graphs
• Compressions, graphs, and hyperreflexivity
• Entropy of some models of sparse random graphs with vertex-names
• Concept lattices as a search space for graph compression
• Predictability of complex systems
• Compression of dynamic graphs generated by a duplication model
• Caractérisation de la fonctionnalité des courbes obtenues par compression de graphe
• scientific article; zbMATH DE number 1262802 (Why is no real title available?)
• Compressing Bounded Degree Graphs

This page was built for publication: Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

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