Fast and Compact Planar Embeddings
Date
2017
Type:
Other
item.page.extent
item.page.accessRights
item.contributor.advisor
ORCID:
Journal Title
Journal ISSN
Volume Title
Publisher
item.page.isbn
item.page.issn
item.page.issne
item.page.doiurl
item.page.other
item.page.references
Abstract
There are many representations of planar graphs, but few are as elegant as Turan'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 Turan'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. (C) 2020 Elsevier B.V. All rights reserved
Description
Conference paper
item.page.coverage.spatial
item.page.sponsorship
Citation
Ferres L., Fuentes J., Gagie T., He M., Navarro G. (2017) Fast and Compact Planar Embeddings. In: Ellen F., Kolokolova A., Sack JR. (eds) Algorithms and Data Structures. WADS 2017. Lecture Notes in Computer Science, vol 10389. Springer, Cham
Keywords
Planar embedding, Compact data structures, Parallel construction