Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits.

Published in: SIAM J. Comput. (2014)

Keyphrases

computational complexity
metadata
small number
keywords
optimal solution
information extraction
information sharing
prior knowledge
spatial information
structural information
raw data