Nimrod Megiddo
Journal of Symbolic Computation
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
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
A.R. Conn, Nick Gould, et al.
Mathematics of Computation