




























${\cal A}_\mathsf{deg}$ is a self-stabilizing algorithm that computes a maximal independent set in a finite graph with approximation ratio $(Δ+ 2)/3$. In this note we show that under the central scheduler the number of moves of ${\cal A}_\mathsf{deg}$ is not bounded by a polynomial in $n$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。