scientific article; zbMATH DE number 140152

MaRDI QIDQ4028537zbMATH OpenFDO

Authors Alice A. McRae, Stephen T. Hedetniemi

Publication date 28 March 1993

zbMATH Keywords

\(n\)-independent dominating setdistanceNP-hardpolynomial algorithmtrees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 844146
• A constructive characterization of trees with the same independent domination number.
• On approximating the minimum independent dominating set
• scientific article; zbMATH DE number 1389216
• An algorithm to find two distance domination parameters in a graph

Cited in

(8)

• An algorithm to find two distance domination parameters in a graph
• On the complexity of independent dominating set with obligations in graphs
• Very cost effective bipartitions in graphs
• Finding dominators via disjoint set union
• scientific article; zbMATH DE number 1367677 (Why is no real title available?)
• scientific article; zbMATH DE number 844146 (Why is no real title available?)
• scientific article; zbMATH DE number 1389216 (Why is no real title available?)
• On approximating the minimum independent dominating set

This page was built for publication:

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