adjacency labeling 1distance constraints 1erdos-posa property 1graph encoding 1graph separators 1long cycles 1minor-closed graph classes 1parameterized bounds 1planar graphs 1universal graphs 1
From the 2 of 20 linked papers with an AI index.
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Adjacency labelling for proper minor-closed graph classes
Vida DujmoviÄ, Cyril Gavoille, Gwenaël Joret +3
The paper proves that every proper minor‑closed class of graphs admits an adjacency labeling scheme using (1+o(1))·log₂ n bits, equivalently showing the existence of an n^{1+o(1)}‑…
cs.DM2026
Sample compression schemes for balls in structurally sparse graphs
Romain Bourneuf, JÄdrzej Hodor, Piotr Micek +1
Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many learning algorithms. In a sample compression scheme, we…