Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
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
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Conference paper
Motion video analysis using planar parallax
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994