Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q4828935)
From MaRDI portal
(Redirected from Item:Q5494926)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits |
scientific article; zbMATH DE number 6323067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits |
scientific article; zbMATH DE number 6323067 |
Statements
29 November 2004
0 references
30 July 2014
0 references
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (English)
0 references
planar graphs
0 references
graph algorithms
0 references
data structures
0 references
compression
0 references
