Domination and its variants in split graphs -P versus NPC dichotomy
From MaRDI portal
Publication:2692638
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Recommendations
- Complexity of total outer-connected domination problem in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- Complexity issues of variants of secure domination in graphs
- Algorithmic complexity of secure connected domination in graphs
- Dominating sets for split and bipartite graphs
Cites work
- Complexity of total outer-connected domination problem in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Connected dominating set. Theory and applications
- Dominating sets for split and bipartite graphs
- Downhill and uphill domination in graphs
- Hamiltonicity in Split Graphs - A Dichotomy
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Introduction to algorithms.
- On the complexity of the minimum outer-connected dominating set problem in graphs
- On the total outer-connected domination in graphs
- Parameterized algorithms
- Reducibility among combinatorial problems
- Solving connected dominating set faster than \(2^n\)
- The outer-connected domination number of a graph
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
- Total outer-connected domination in trees
This page was built for publication: Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692638)
