The algorithmic complexity of mixed domination in graphs
DOI10.1016/J.TCS.2011.01.029zbMATH Open1216.68119OpenAlexW2021417413MaRDI QIDQ533883FDOQ533883
Authors: Moo Young Sohn, Yancai Zhao, Liying Kang 
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.029
Recommendations
- On the mixed domination problem in graphs
- Mixed domination in undirected path graphs and block graphs
- An efficient algorithm for mixed domination on generalized series-parallel graphs
- On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
- Mixed tree domination number
Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Algorithmic Complexity of Total Domination
- Some simplified NP-complete graph problems
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Edge Dominating Sets in Graphs
- A linear algorithm for the domination number of a tree
- Edge domination in graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Title not available (Why is that?)
- Dominating Sets in Chordal Graphs
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- On total matching numbers and total covering numbers of complementary graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Total matchings and total coverings of graphs
- On total covers of graphs
- Optimum domination in weighted trees
- A characterization of strongly chordal graphs
- A recognition algorithm for the total graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- Complexity and algorithms for semipaired domination in graphs
- Mixed tree domination number
- Law of large numbers for a two-dimensional class cover problem
- Upper and lower bounds on approximating weighted mixed domination
- Improved parameterized algorithms and kernels for mixed domination
- Mixed domination and 2-independence in trees
- On the algorithmic complexity of edge total domination
- Improved budgeted connected domination and budgeted edge-vertex domination
- Title not available (Why is that?)
- Signed mixed dominating functions in complete bipartite graphs
- Signed mixed Roman domination numbers in graphs
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- An efficient algorithm for distance total domination in block graphs
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- On the mixed domination problem in graphs
- Explicit construction of mixed dominating sets in generalized Petersen graphs
- Mixed Roman domination in graphs
- Total mixed domination in graphs
- The strong domination problem in block graphs and proper interval graphs
- On the complexity of variations of mixed domination on graphs†
- On the complexity of Mixed Dominating Set
- Title not available (Why is that?)
This page was built for publication: The algorithmic complexity of mixed domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533883)
