Chai Wah Wu
Linear Algebra and Its Applications
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
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum