On the complexity of the minimum outer-connected dominating set problem in graphs
From MaRDI portal
Recommendations
- Algorithm and hardness results for outer-connected dominating set in graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Complexity of total outer-connected domination problem in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- The outer-connected domination number of a graph
Cites work
- A threshold of ln n for approximating set cover
- Approximation hardness of dominating set problems in bounded degree graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Non-approximability results for optimization problems on bounded degree instances
- On the outer-connected domination in graphs
- On the total outer-connected domination in graphs
- Optimization, approximation, and complexity classes
- Reducibility among combinatorial problems
- The outer-connected domination number of a graph
- Total outer-connected domination in trees
- Total outer-connected domination numbers of trees
Cited in
(15)- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- Domination and outer connected domination in maximal outerplanar graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- A note on the complexity of minimum dominating set
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- Algorithm and hardness results for outer-connected dominating set in graphs
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
- Impact of diameter and convex ordering for Hamiltonicity and domination
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- Outer connected domination in maximal outerplanar graphs and beyond
- Bisplit graphs -- a structural and algorithmic study
- Complexity of total outer-connected domination problem in graphs
This page was built for publication: On the complexity of the minimum outer-connected dominating set problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963605)
