Algorithmic Aspects of Disjunctive Total Domination in Graphs
DOI10.1007/978-3-319-48749-6_21zbMath1465.68213OpenAlexW2545970684MaRDI QIDQ2958321
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_21
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) 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) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Disjunctive total domination in graphs
- Total domination and transformation
- Bounds on the disjunctive total domination number of a tree
- A survey of selected recent results on total domination in graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Total domination in interval graphs revisited
- Labeling algorithms for domination problems in sun-free chordal graphs
- The complexity of domination problems in circle graphs
- Domination versus disjunctive domination in trees
- Minimum-cost flow algorithms: an experimental evaluation
- The disjunctive domination number of a graph
- Algorithmic Aspects of Disjunctive Domination in Graphs
- On the Algorithmic Complexity of Total Domination
- Dominating Sets in Chordal Graphs
- Graphs with large total domination number
- Total Domination in Graphs
- Graphs with Large Disjunctive Total Domination Number
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
This page was built for publication: Algorithmic Aspects of Disjunctive Total Domination in Graphs
