Login / Signup
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.
Hsueh-I Lu
Published in:
SODA (2002)
Keyphrases
</>
small number
image compression
information processing
optimal solution
semantic information
domain knowledge
dynamic programming
information extraction
contextual information
structural information
compression ratio
graph theory