Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
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
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Matthew A Grayson
Journal of Complexity
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems