A 1-PLS of cost p implies a t-PLS of cost O(ceil(p/t)) up to log n factors in general graphs and O(ceil(p/t) + log n) in fixed minor-free graphs.
Mathematical Proceedings of the Cambridge Philosophical Society , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.
citing papers explorer
-
Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
A 1-PLS of cost p implies a t-PLS of cost O(ceil(p/t)) up to log n factors in general graphs and O(ceil(p/t) + log n) in fixed minor-free graphs.
-
Colorful Minors
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.