Fast and Compact Planar Embeddings
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.extent
36 p.
item.page.accessRights
item.page.other
item.page.references
Abstract
There 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 multi-edges, and can store a...
Description
item.page.coverage.spatial
item.page.sponsorship
Citation
Computational Geometry Volume 89, August 2020
Keywords
item.page.dc.rights
item.page.dc.rights.url
Estadísticas de uso
1 0,8 0,5 0,3 0
Septiembre 2025Octubre 2025Noviembre 2025Diciembre 2025Enero 2026Febrero 2026Marzo 2026