Some results for the two disjoint connected dominating sets problem

DOI10.1142/S1793830919500654zbMATH Open1427.05165MaRDI QIDQ5207499FDOQ5207499

Authors: Xianliang Liu, Zishen Yang, Wei Wang 

Publication date: 2 January 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• scientific article
• 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

zbMATH Keywords

cubic graphgirthconnected dominating settwo disjoint connected dominating sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Approximation algorithms for connected dominating sets
• Improved methods for approximating node weighted Steiner trees and connected dominating sets.
• Title not available (Why is that?)
• A greedy approximation for minimum connected dominating sets
• Tighter approximation bounds for minimum CDS in wireless ad hoc networks
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Title not available (Why is that?)

Cited In (1)

• Algorithm and complexity of the two disjoint connected dominating sets problem on trees

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)