Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.
Journal
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA.
Pages
223-224
Date Issued
2002
Author(s)
HSUEH-I LU
Type
conference paper