Representation of graphs

DOI10.1007/BF00288971MaRDI QIDQ1157966zbMATH OpenOpenAlexFDO

Authors 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

adjacency listsdata compressioninformation theoretic lower bounds

Mathematics Subject Classification ID

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

Cites work

• Efficient Planarity Testing
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• scientific article; zbMATH DE number 3412677 (Why is no real title available?)

Cited in

(6)

• Simple planar graph partition into three forests
• Short encodings of planar graphs and maps
• Representing graphs implicitly using almost optimal space
• Succinct data structure for chordal graphs with bounded vertex leafage
• On the succinct representation of graphs
• Graph compression and the zeros of polynomials

This page was built for publication: Representation of graphs

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