Self-Stabilizing Domination Algorithms (Q3384122)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Self-Stabilizing Domination Algorithms	scientific article

Statements

scholarly article

0 references

Self-Stabilizing Domination Algorithms (English)

0 references

Stephen T. Hedetniemi

0 references

Developments in Mathematics

0 references

publication date

14 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-58892-2_16

0 references

An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks

0 references

Unfriendly partitions of a graph

0 references

Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs

0 references

0 references

On an upper bound of the graph's chromatic number, depending on the graph's degree and density

0 references

Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

0 references

A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

0 references

A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

0 references

0 references

Maximum Matching for Anonymous Trees with Constant Space per Process

0 references

Self-stabilizing systems in spite of distributed control

0 references

A belated proof of self-stabilization

0 references

New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets

0 references

Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph

0 references

0 references

0 references

0 references

High Performance Computing - HiPC 2003

0 references

Distance-k Information in Self-stabilizing Algorithms

0 references

Distance-\(k\) knowledge in self-stabilizing algorithms

0 references

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

0 references

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

0 references

A self-stabilizing algorithm for optimally efficient sets in graphs

0 references

SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS

0 references

A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets

0 references

Maximal matching stabilizes in time \(O(m)\)

0 references

A self-stabilizing algorithm for maximal matching

0 references

A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

0 references

An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers

0 references

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks

0 references

Fast, silent self-stabilizing distance-\(k\) independent dominating set construction

0 references

A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET

0 references

A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs

0 references

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

0 references

A new self-stabilizing maximal matching algorithm

0 references

A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem

0 references

Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs

0 references

0 references

0 references

A self-stabilizing algorithm to maximal 2-packing with improved complexity

0 references

Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph

0 references

A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler

0 references

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

0 references

Efficient transformation of distance-2 self-stabilizing algorithms

0 references

Self-stabilizing algorithms for efficient sets of graphs and trees

0 references

A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

0 references

A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

0 references

A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks

0 references

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

0 references

Distributed Computing - IWDC 2003

0 references

Maximal matching stabilizes in quadratic time

0 references

Identifiers

10.1007/978-3-030-58892-2_16

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3384122

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3384122&oldid=36749971"