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
We show that every proper minor-closed class of graphs admits a -bit adjacency labelling scheme. Equivalently, for every proper minor-closed class a…
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…