The algorithmic complexity of mixed domination in graphs
From MaRDI portal
Publication:533883
DOI10.1016/J.TCS.2011.01.029zbMATH Open1216.68119OpenAlexW2021417413MaRDI QIDQ533883FDOQ533883
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
Cites Work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 841565 (Why is no real title available?)
- scientific article; zbMATH DE number 861309 (Why is no real title available?)
- A characterization of strongly chordal graphs
- A linear algorithm for the domination number of a tree
- A recognition algorithm for the total graphs
- Characterizations of strongly chordal graphs
- Dominating Sets in Chordal Graphs
- Dominating sets for split and bipartite graphs
- Domination and location in acyclic graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Edge Dominating Sets in Graphs
- Edge domination in graphs
- On the Algorithmic Complexity of Total Domination
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On total covers of graphs
- On total matching numbers and total covering numbers of complementary graphs
- Optimum domination in weighted trees
- Some simplified NP-complete graph problems
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Three Partition Refinement Algorithms
- Total matchings and total coverings of graphs
Cited In (27)
- Mixed domination in undirected path graphs and block graphs
- Mixed tree domination number
- Law of large numbers for a two-dimensional class cover problem
- On simultaneous domination and mixed connectivity in graphs
- Upper and lower bounds on approximating weighted mixed domination
- Improved parameterized algorithms and kernels for mixed domination
- Mixed Dominating Set: a parameterized perspective
- 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 no real title available?)
- An efficient algorithm for mixed domination on generalized series-parallel graphs
- 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
- On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
- New algorithms for mixed dominating set
- The strong domination problem in block graphs and proper interval graphs
- On the complexity of Mixed Dominating Set
- Title not available (Why is no real title available?)
- On the complexity of variations of mixed domination on graphs
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)
