Algorithmic Aspects of Disjunctive Total Domination in Graphs

DOI10.1007/978-3-319-48749-6_21zbMath1465.68213MaRDI QIDQ2958321

Sheng-Lung Peng, Chin-Fu Lin

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

zbMATH Keywords

trees; total domination; disjunctive total domination; minimum-cost flow algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms