Total domination and transformation

DOI10.1016/S0020-0190(97)00115-4MaRDI QIDQ287166zbMATH OpenOpenAlexFDO

Authors Dieter Kratsch, Lorna Stewart

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00115-4

zbMATH Keywords

dominationdesign of algorithmsefficient algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Total domination in block graphs
• Total domination in interval graphs
• Total domination in interval graphs
• On the Algorithmic Complexity of Total Domination
• scientific article; zbMATH DE number 3910441

Cites work

• An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
• Dominating sets in perfect graphs
• Domination in convex and chordal bipartite graphs

Cited in

(12)

• A smooth transition from powerlessness to absolute power
• Domination and total domination on asteroidal triple-free graphs
• Critical concepts in domination
• A survey of selected recent results on total domination in graphs
• Leaf sector covers with applications on circle graphs
• Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• Domination in rose window graphs
• An efficient algorithm for distance total domination in block graphs
• Algorithmic aspects of disjunctive total domination in graphs
• Domination in distance-hereditary graphs
• On total \(f\)-domination: polyhedral and algorithmic results

This page was built for publication: Total domination and transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287166)