Graph compression and the zeros of polynomials

DOI10.1016/J.IPL.2004.06.004zbMath1173.68610OpenAlexW2085667426MaRDI QIDQ834888

Narsingh Deo, Bruce Litow

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.004

zbMATH Keywords

data compressiongraphstheory of computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representation of graphs
• Succinct representation of general unlabeled graphs
• Succinct Representation of Balanced Parentheses and Static Trees
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits

This page was built for publication: Graph compression and the zeros of polynomials