For every fixed k and every MSO2 graph property, there is an optimal O(log n)-bit proof labeling scheme for graphs of pathwidth at most k, implying O(log n)-bit certification of F-minor-free graphs for any fixed forest F.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal local certification on graphs of bounded pathwidth
For every fixed k and every MSO2 graph property, there is an optimal O(log n)-bit proof labeling scheme for graphs of pathwidth at most k, implying O(log n)-bit certification of F-minor-free graphs for any fixed forest F.