Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Paper
Succinct representation of general unlabeled graphs
Abstract
We show that general unlabeled graphs on n nodes can be represented by (n2) - n log2 n + O(n) bits which is optimal up to the O(n) term. Both the encoding and decoding require linear time. © 1990.
Related
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Imran Nasim, Michael E. Henderson
Mathematics
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences