R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
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
Chai Wah Wu
Linear Algebra and Its Applications
Conference paper
Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering