M. Tismenetsky
International Journal of Computer Mathematics
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
Nimrod Megiddo
Journal of Symbolic Computation
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics