Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs

DOI10.1007/11940128_45MaRDI QIDQ5459139zbMATH OpenOpenAlexFDO

Authors Chunmei Liu, Yinglei Song

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_45

Mathematics Subject Classification ID

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

Recommendations

• Fast algorithms for min independent dominating set
• Fast algorithms for \textsc{min independent dominating set}
• A branch-and-reduce algorithm for finding a minimum independent dominating set
• A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
• Graph-Theoretic Concepts in Computer Science

Cited in

(15)

• Fast algorithms for min independent dominating set
• Small \(k\)-pyramids and the complexity of determining \(k\)
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
• Two algorithms for determining a minimum independent dominating set
• An Exact Algorithm for the Minimum Dominating Clique Problem
• A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
• Fast algorithms for \textsc{min independent dominating set}
• scientific article; zbMATH DE number 3929037 (Why is no real title available?)
• An Efficient Local Search for the Minimum Independent Dominating Set Problem
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
• 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
• Graph-Theoretic Concepts in Computer Science
• Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
• Approximating the minimum independent dominating set in perturbed graphs

This page was built for publication: Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs

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