David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
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
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992