Tong Zhang, G.H. Golub, et al.
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
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Charles Micchelli
Journal of Approximation Theory