Two algorithms for determining a minimum independent dominating set

DOI10.1080/00207168408803411zbMATH Open0535.68031OpenAlexW2022576587MaRDI QIDQ3319782FDOQ3319782

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

Recommendations

• A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
• Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
• Solving the minimum independent domination set problem in graphs by exact algorithm and greedy heuristic
• A branch-and-reduce algorithm for finding a minimum independent dominating set
• On approximating the minimum independent dominating set

zbMATH Keywords

dynamic programming algorithmNP-hardminimum independent dominating setbacktracking algorithmcombinatorial optimaization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bottleneck extrema
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• A linear algorithm for the domination number of a tree
• Dominating Sets in Chordal Graphs
• 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

Cited In (1)

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

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

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