Algorithmic results on locating-total domination in graphs
DOI10.1016/J.DAM.2023.03.007zbMATH Open1514.05124OpenAlexW4327630313MaRDI QIDQ6157416FDOQ6157416
Authors: Abolfazl Poureidi, Mohammad Farshi 
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.007
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) 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
- Approximation algorithms for combinatorial problems
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Locating-total domination in graphs
- A note on the complexity of locating-total domination in graphs
- Locating and total dominating sets in trees
- Locating-total domination in claw-free cubic graphs
- Bounds on the locating-total domination number of a tree
- The complexity of domination problems in circle graphs
- Graphs of separability at most 2
- A note on the locating-total domination in graphs
Cited In (8)
- Progress towards the two-thirds conjecture on locating-total dominating sets
- Algorithmic aspects of open neighborhood location-domination in graphs
- Algorithmic and NP-completeness aspects of a total lict domination number of a graph
- A note on the locating-total domination in graphs
- An extension of locating-total domination problem and its complexity
- A note on the complexity of locating-total domination in graphs
- An efficient sum query algorithm for distance-based locally dominating functions
- Algorithm and hardness results on neighborhood total domination in graphs
This page was built for publication: Algorithmic results on locating-total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157416)
