k-Efficient domination: Algorithmic perspective
From MaRDI portal
Publication:6115759
DOI10.1142/s1793830922500513zbMath1517.05134OpenAlexW4206158811MaRDI QIDQ6115759
Publication date: 13 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500513
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the parameterized complexity of multiple-interval graph problems
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Weighted efficient domination problem on some perfect graphs
- The weighted perfect domination problem and its variants
- Perfect codes in graphs
- FPT Algorithms for Domination in Biclique-Free Graphs
- Domination Problems in Nowhere-Dense Classes
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Total Domination in Graphs
- $k$-Efficient partitions of graphs
- Double domination and super domination in trees
- Algorithmic aspects of k-part degree restricted domination in graphs
- On the domination number of a graph and its total graph
This page was built for publication: k-Efficient domination: Algorithmic perspective
