The sequence of binary search treesT 1

is approximately 2 √ logn, so that any root-to-leaf path inBcan be represented using logr+O( p logn) bits, for anyr∈ O(n)

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

1 Pith paper citing it

browse 1 citing papers

citation-role summary

background 1

background 1

cs.DM · 2026-05-07 · unverdicted · novelty 8.0

Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.

Showing 1 of 1 citing paper.

Adjacency labelling for proper minor-closed graph classes cs.DM · 2026-05-07 · unverdicted · none · ref 27
Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.