Succinct representation of general unlabeled graphs

DOI10.1016/0166-218X(90)90011-ZzbMath0725.05048MaRDI QIDQ2277480

Moni Naor

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

binary encoding

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (6)

Graph compression and the zeros of polynomials ⋮ Simple planar graph partition into three forests ⋮ Quick encoding of plane graphs in \(\log _{2}14\) bits per edge ⋮ Short encodings of planar graphs and maps ⋮ On the OBDD size for graphs of bounded tree- and clique-width ⋮ Finite presentation of homogeneous graphs, posets and Ramsey classes

Cites Work

• On the succinct representation of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Succinct representation of general unlabeled graphs