Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems (Q5207898): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1571766706
@@ Property / OpenAlex ID: W1571766706 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00378
@@ Property / arXiv ID: 1502.00378 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on evolving graphs
@@ Property / cites work: Algorithms on evolving graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring unstructured wireless multi-hop networks
@@ Property / cites work: Coloring unstructured wireless multi-hop networks / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
+Normal rank
@@ Property / cites work @@
+An optimal maximal independent set algorithm for bounded-independence graphs
+Normal rank
@@ Property / cites work @@
+Coordinated consensus in dynamic networks
@@ Property / cites work: Coordinated consensus in dynamic networks / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed computation in dynamic networks
@@ Property / cites work: Distributed computation in dynamic networks / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
+Normal rank
@@ Property / cites work @@
+Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
+Normal rank
@@ Property / cites work @@
+Q4398822
@@ Property / cites work: Q4398822 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5207898