Matthew A Grayson
Journal of Complexity
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
Julian Schuhmacher, Marco Ballarin, et al.
PRX Quantum
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.