Fast and compact planar embeddings

dc.contributor.authorFerres, Leo
dc.contributor.authorFuentes-Sepúlveda, José
dc.contributor.authorGagie, Travis
dc.contributor.authorHe, Meng
dc.contributor.authorNavarro, Gonzalo
dc.date.accessioned2021-08-11T13:21:08Z
dc.date.available2021-08-11T13:21:08Z
dc.date.issued2020
dc.description.abstractThere are many representations of planar graphs, but few are as elegant as Turán’s (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multiedges, and can store any specified embedding. Its main disadvantage has been that “it does not allow efficient searching” (Jacobson, 1989). In this paper we show how to add a sublinear number of bits to Turán’s representation such that it supports fast navigation while retaining simplicity. As a consequence of the inherited simplicity, we offer the first efficient parallel construction of a compact encoding of a planar graph embedding. Our experimental results show that the resulting representation uses about 6 bits per edge in practice, supports basic navigation operations within a few microseconds, and can be built sequentially at a rate below 1 microsecond per edge, featuring a linear speedup with a parallel efficiency around 50% for large datasets.es
dc.format.extent21 p.es
dc.identifier.citationComputational Geometry 89(2020)es
dc.identifier.urihttps://doi.org/10.1016/j.comgeo.2020.101630es
dc.identifier.urihttp://hdl.handle.net/11447/4281
dc.language.isoenes
dc.subjectPlanar embeddinges
dc.subjectCompact data structureses
dc.subjectParallel constructiones
dc.titleFast and compact planar embeddingses
dc.typeArticlees

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Fast and compact planar embeddings.pdf
Size:
653.84 KB
Format:
Adobe Portable Document Format
Description:
Texto completo
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: