works on
disjoint subgraphs 1erdos-pósa property 1graph minors 1parameterized algorithms 1rooted minors 1tree minors 1

From the 1 of 17 linked papers with an AI index.

activity
20242026
collaborators
Showing cs.DMShow all

1 paper · 1 filter

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…