Distributed dominating sets in interval graphs

DOI10.1007/978-3-031-22105-7_45OpenAlexW4313343337MaRDI QIDQ6168973FDOQ6168973

Authors: Barun Gorain, Kaushik Mondal, 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

zbMATH Keywords

approximation algorithmsdistributed algorithmsinterval graphsminimum connected dominating setminimum dominating set

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Distributed Computing: A Locality-Sensitive Approach
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Local computation: lower and upper bounds
• Distributed independent sets in interval and segment intersection graphs
• On the complexity of local distributed graph problems

This page was built for publication: Distributed dominating sets in interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168973)