Some results for the two disjoint connected dominating sets problem
From MaRDI portal
Publication:5207499
Recommendations
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- scientific article; zbMATH DE number 5531984
- Disjoint dominating and 2-dominating sets in graphs
- Graphs with disjoint dominating and paired-dominating sets
- Pairs of disjoint dominating sets and the minimum degree of graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1202982 (Why is no real title available?)
- scientific article; zbMATH DE number 2109321 (Why is no real title available?)
- A greedy approximation for minimum connected dominating sets
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- Approximation algorithms for connected dominating sets
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Tighter approximation bounds for minimum CDS in wireless ad hoc networks
Cited in
(1)
This page was built for publication: Some results for the two disjoint connected dominating sets problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207499)
