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

03/25/2022
βˆ™
by   Volker Turau, et al.
βˆ™
0
βˆ™

A_𝖽𝖾𝗀 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 A_𝖽𝖾𝗀 is not bounded by a polynomial in n.

READ FULL TEXT

page 1

page 2

page 3

research
βˆ™ 03/21/2022

Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets

Sensor networks, such as ultra-wideband sensors for the smart warehouse,...
research
βˆ™ 01/26/2021

Self-stabilizing Algorithm for Maximal Distance-2 Independent Set

In graph theory, an independent set is a subset of nodes where there are...
research
βˆ™ 03/27/2020

Large independent sets on random d-regular graphs with d small

In this paper, we present a prioritized local algorithm that computes a ...
research
βˆ™ 11/28/2017

The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

This note is about a reasonable abstract machine, called Maximal MAM, im...
research
βˆ™ 11/29/2022

Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm

Programs admitting a polyhedral representation can be transformed in man...
research
βˆ™ 01/26/2022

Understanding and Compressing Music with Maximal Transformable Patterns

We present a polynomial-time algorithm that discovers all maximal patter...
research
βˆ™ 06/14/2016

A Note on the Period Enforcer Algorithm for Self-Suspending Tasks

The period enforcer algorithm for self-suspending real-time tasks is a t...

Please sign up or login with your details

Forgot password? Click here to reset