Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
From MaRDI portal
Publication:5459139
DOI10.1007/11940128_45zbMath1135.05315OpenAlexW1498327260MaRDI QIDQ5459139
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
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm ⋮ An Efficient Local Search for the Minimum Independent Dominating Set Problem
This page was built for publication: Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
