Skip to content

Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.

Hsueh-I Lu

VenueA*SODA
Year2002
ProceedingsSODA

Browse the full SODA paper archive.