A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
type: Item
instance of: scholarly article
title: A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
zbMATH Open document ID: 1331.05169
author: Stephen T. Hedetniemi
author: David P. Jacobs
author: K. E. Kennedy
published in: Theoretical Computer Science
publication date: 2015-10-08T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6492062
zbMATH Keywords: self-stabilizing algorithm
zbMATH Keywords: minimal dominating set
zbMATH Keywords: maximal independent set
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.06.004
OpenAlex ID: W643669290
cites work: Q3872483
cites work: Disjoint independent dominating sets in graphs
cites work: Self-stabilizing systems in spite of distributed control
cites work: A belated proof of self-stabilization
cites work: Self-stabilization
cites work: Disjoint cliques and disjoint maximal independent sets of vertices in graphs
cites work: Distance-\(k\) knowledge in self-stabilizing algorithms
cites work: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
cites work: Q4368728
cites work: Q4368729
cites work: Trees with two disjoint minimum independent dominating sets
cites work: Remarks about disjoint dominating sets
cites work: Q3070350
cites work: Q4222093
cites work: Q3580272
cites work: Q3291034
cites work: A characterization of graphs with disjoint dominating and paired-dominating sets
DOI: 10.1016/J.TCS.2015.06.004
description: scientific article; zbMATH DE number 6492062