BIP! Finder - Adjacency Labelling for Planar Graphs (and Beyond)

2020 • Adjacency Labelling for Planar Graphs (and Beyond)

Authors: Dujmović, Vida V.; Esperet, Louis; Gavoille, Cyril; Joret, Gwenaël; Micek, Piotr; Morin, Pat

Venue: Journal of the ACM

Type: Publication

Abstract: We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an n -vertex planar graph G is assigned a (1 + o(1)) log 2 n -bit label and the labels of two vertices u and v are sufficient to determine if uv is an edge of G . This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every positive integer n , there exists a graph U n with n 1+o(1) vertices such that every n -vertex planar graph is an i... (read more)

Impact:

2.0967528E-8 4.0327914E-9 22 18

/ Attention: 0 24

Topics: Combinatorics Discrete mathematics

DOI: 10.1109/focs46700.2020.00060

External links: Crossref OpenAIRE

Found 3 versions BibTex PDF

Topic-specific impact indicators

Popularity:
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Influence:
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citation Count:
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Impulse:
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.