Optimal labelling schemes for adjacency, comparability, and reachability

DOI10.1145/3406325.3451102arXiv2012.01764OpenAlexW3169223589MaRDI QIDQ6065235

Alexander D. Scott, Carla Groenland, Marthe Bonamy, Louis Esperet

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.01764

zbMATH Keywords

graph labellingadjacency labellingdense graph classesreachability labelling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Logical labeling schemes

This page was built for publication: Optimal labelling schemes for adjacency, comparability, and reachability