Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering