Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits (2002)

by H-I Lu
Venue:In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms