Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q5494926): Difference between revisions
From MaRDI portal
Item:Q5494926
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:06, 7 March 2024
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
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (English)
0 references
30 July 2014
0 references
planar graphs
0 references
graph algorithms
0 references
data structures
0 references
compression
0 references
