Distributed dominating sets in interval graphs
From MaRDI portal
Publication:6168973
DOI10.1007/978-3-031-22105-7_45OpenAlexW4313343337MaRDI QIDQ6168973
Kaushik Mondal, Barun Gorain, Supantha Pandit
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_45
approximation algorithmsdistributed algorithmsinterval graphsminimum connected dominating setminimum dominating set
Cites Work
- Unnamed Item
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Distributed independent sets in interval and segment intersection graphs
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Local Computation
- Distributed Computing: A Locality-Sensitive Approach
- On the complexity of local distributed graph problems
- Reducibility among Combinatorial Problems
This page was built for publication: Distributed dominating sets in interval graphs