The strong domination problem in block graphs and proper interval graphs
From MaRDI portal
Publication:5207497
DOI10.1142/S1793830919500630zbMath1427.05167OpenAlexW2972133463WikidataQ127321693 ScholiaQ127321693MaRDI QIDQ5207497
Publication date: 2 January 2020
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830919500630
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic complexity of mixed domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Rainbow domination on trees
- A linear time recognition algorithm for proper interval graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- A linear algorithm for the domination number of a tree
- The influence of special vertices on strong domination
- Strong weak domination and domination balance in a graph
- Perfect graphs of strong domination and independent strong domination
- On parameters related to strong and weak domination in graphs
- On the mixed domination problem in graphs
- Bounds on the strong domination number
- Algorithmic aspects of the \(k\)-domination problem in graphs
- A threshold of ln n for approximating set cover
- On the Algorithmic Complexity of Total Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- A Greedy Heuristic for the Set-Covering Problem
- Edge Dominating Sets in Graphs
- Dominating Sets in Chordal Graphs
- Bounds on weak and strong total domination in graphs
This page was built for publication: The strong domination problem in block graphs and proper interval graphs
