Algorithmic Aspects of Disjunctive Total Domination in Graphs
DOI10.1007/978-3-319-48749-6_21zbMATH Open1465.68213OpenAlexW2545970684MaRDI QIDQ2958321FDOQ2958321
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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Minimum-cost flow algorithms: an experimental evaluation
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Disjunctive total domination in graphs
- The disjunctive domination number of a graph
- On the Algorithmic Complexity of Total Domination
- Graphs with large total domination number
- Total Domination in Graphs
- A survey of selected recent results on total domination in graphs
- Total domination and transformation
- Dominating Sets in Chordal Graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- The complexity of domination problems in circle graphs
- Total domination in interval graphs revisited
- Domination versus disjunctive domination in trees
- Algorithmic Aspects of Disjunctive Domination in Graphs
- Graphs with Large Disjunctive Total Domination Number
- Bounds on the disjunctive total domination number of a tree
Cited In (5)
This page was built for publication: Algorithmic Aspects of Disjunctive Total Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958321)
