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.
International Colloquium on Structural Information and Communication Complexity , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.