D.S. Turaga, K. Ratakonda, et al.
SCC 2006
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
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications