Two algorithms for determining a minimum independent dominating set

DOI10.1080/00207168408803411zbMath0535.68031OpenAlexW2022576587MaRDI QIDQ3319782

Emmanuel Loukakis

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803411

zbMATH Keywords

NP-harddynamic programming algorithmminimum independent dominating setbacktracking algorithmcombinatorial optimaization

Mathematics Subject Classification ID

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

Related Items (1)

Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for the domination number of a tree
• Disjoint independent dominating sets in graphs
• Optimum domination in weighted trees
• On covering sets and error-correcting codes
• On the composition and decomposition of clutters
• Dominating Sets in Chordal Graphs
• Towards a theory of domination in graphs
• Bottleneck extrema

This page was built for publication: Two algorithms for determining a minimum independent dominating set