Representation of graphs

DOI10.1007/BF00288971zbMath0471.68042OpenAlexW2009310861MaRDI QIDQ1157966

Alon Itai, Michael Rodeh

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288971

zbMATH Keywords

data compressionadjacency listsinformation theoretic lower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Graph compression and the zeros of polynomials ⋮ Simple planar graph partition into three forests ⋮ Representing graphs implicitly using almost optimal space ⋮ Short encodings of planar graphs and maps ⋮ On the succinct representation of graphs

Cites Work

• Efficient Planarity Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation of graphs