Distributed algorithms for edge dominating sets

DOI10.1145/1835698.1835783zbMath1315.68276OpenAlexW2146700655MaRDI QIDQ5176213

Jukka Suomela

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835783

zbMATH Keywords

approximation\textsc{Edge Dominating Set}port-numbered network

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (5)

Exact Bounds for Distributed Graph Colouring ⋮ Improved deterministic distributed matching via rounding ⋮ Analysing local algorithms in location-aware quasi-unit-disk graphs ⋮ Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers ⋮ Weak models of distributed computing, with connections to modal logic

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Distributed algorithms for edge dominating sets