Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q5494926): Difference between revisions
From MaRDI portal
Item:Q5494926
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 22:39, 5 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
