Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems

DOI10.1007/978-3-319-21741-3_4zbMath1428.68150arXiv1502.00378OpenAlexW1571766706MaRDI QIDQ5207898

Franck Petit, Mohamed-Hamza Kaaouachi, Swan Dubois

Publication date: 14 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.00378

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (3)

Computing parameters of sequence-based dynamic graphs ⋮ Robustness: a new form of heredity motivated by dynamic networks ⋮ Self-stabilizing robots in highly dynamic environments

Cites Work

• Unnamed Item
• An optimal maximal independent set algorithm for bounded-independence graphs
• Algorithms on evolving graphs
• Distributed computation in dynamic networks
• Coordinated consensus in dynamic networks
• Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
• Coloring unstructured wireless multi-hop networks
• Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

This page was built for publication: Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems