Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational 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
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003