Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings (Q4699160)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1367300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings |
scientific article; zbMATH DE number 1367300 |
Statements
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings (English)
0 references
23 November 1999
0 references
data compression
0 references
graph encoding
0 references
canonical ordering
0 references
planar graphs
0 references
triconnected graphs
0 references
triangulations
0 references
0.860878050327301
0 references
0.8579278588294983
0 references
0.8444482088088989
0 references
0.8321323394775391
0 references
