SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS (Q5408358): Difference between revisions

@@ Property / cites work @@
+Unfriendly partitions of a graph
@@ Property / cites work: Unfriendly partitions of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The satisfactory partition problem
@@ Property / cites work: The satisfactory partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+On an upper bound of the graph's chromatic number, depending on the graph's degree and density
+Normal rank
@@ Property / cites work @@
+Some remarks on alpha-domination
@@ Property / cites work: Some remarks on alpha-domination / rank @@
+Normal rank
@@ Property / cites work @@
+Self-stabilizing systems in spite of distributed control
+Normal rank
@@ Property / cites work @@
+A belated proof of self-stabilization
@@ Property / cites work: A belated proof of self-stabilization / rank @@
+Normal rank
@@ Property / cites work @@
+\(\alpha\)-domination
@@ Property / cites work: \(\alpha\)-domination / rank @@
+Normal rank
@@ Property / cites work @@
+Offensive alliances in graphs
@@ Property / cites work: Offensive alliances in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic approach to the satisfactory graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Distance-\(k\) knowledge in self-stabilizing algorithms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129626413500011
+Normal rank
@@ Property / OpenAlex ID @@
+W2100136595
@@ Property / OpenAlex ID: W2100136595 / rank @@
+Normal rank