Move Complexity of a Self-Stabilizing Algorithm for Maximal Independent Sets

Autor:	Turau, Volker
Rok vydání:	2022
Předmět:	Computer Science - Distributed Parallel and Cluster Computing
Druh dokumentu:	Working Paper
Popis:	${\cal A}_\mathsf{deg}$ is a self-stabilizing algorithm that computes a maximal independent set in a finite graph with approximation ratio $(\Delta + 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$.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2203.13492 Zobrazit plný text záznamu View this record from Arxiv