Near-optimal induced universal graphs for cycles and paths.Discrete Appl

Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel · 2020 · DOI 10.1016/j.dam.2019.10.030

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.CG · 2026-02-11 · unverdicted · novelty 7.0

Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.

Showing 1 of 1 citing paper.

Implicit representations via the polynomial method cs.CG · 2026-02-11 · unverdicted · none · ref 2
Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.