Succinct representation of general unlabeled graphs
From MaRDI portal
Publication:2277480
DOI10.1016/0166-218X(90)90011-ZzbMath0725.05048MaRDI QIDQ2277480
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C30: Enumeration in graph theory
Related Items
Finite presentation of homogeneous graphs, posets and Ramsey classes, Graph compression and the zeros of polynomials, Quick encoding of plane graphs in \(\log _{2}14\) bits per edge, On the OBDD size for graphs of bounded tree- and clique-width, Simple planar graph partition into three forests, Short encodings of planar graphs and maps
Cites Work