Algorithmic aspects of disjunctive total domination in graphs

DOI10.1007/978-3-319-48749-6_21MaRDI QIDQ2958321zbMATH OpenOpenAlexFDO

Authors Chin-Fu Lin, Sheng-Lung Peng

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

treestotal dominationdisjunctive total dominationminimum-cost flow algorithm

Mathematics Subject Classification ID

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)

Recommendations

• B-disjunctive total domination in graphs: algorithm and hardness results
• Algorithmic aspects of disjunctive domination in graphs
• Complexity and bounds for disjunctive total bondage
• On the Algorithmic Complexity of Total Domination
• Algorithmic aspects of semitotal domination in graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A survey of selected recent results on total domination in graphs
• Algorithmic aspects of disjunctive domination in graphs
• Bounds on the disjunctive total domination number of a tree
• Disjunctive total domination in graphs
• Dominating Sets in Chordal Graphs
• Domination versus disjunctive domination in trees
• Graphs with large disjunctive total domination number
• Graphs with large total domination number
• Labeling algorithms for domination problems in sun-free chordal graphs
• Minimum-cost flow algorithms: an experimental evaluation
• On the Algorithmic Complexity of Total Domination
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The complexity of domination problems in circle graphs
• The disjunctive domination number of a graph
• Total domination and transformation
• Total domination in graphs
• Total domination in interval graphs revisited

Cited in

(14)

• scientific article; zbMATH DE number 4051684 (Why is no real title available?)
• Algorithmic aspects of paired disjunctive domination in graphs
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Using genetic algorithm for the discrete domination over time problem
• An incremental algorithm for computing ranked full disjunctions
• Disjunctive total domination stability in graphs
• Exact and heuristic algorithms for the weighted total domination problem
• B-disjunctive total domination in graphs: algorithm and hardness results
• Algorithmic aspects of disjunctive domination in graphs
• Complexity and bounds for disjunctive total bondage
• Algorithmic aspects of total k-subdomination in graphs
• On the Algorithmic Complexity of Total Domination
• Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
• On disjunctive domination in graphs

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)