A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs

Serge Gaspers, Mathieu Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. In Fedor V. Fomin, editor, Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Volume 4271 of Lecture Notes in Computer Science, pages 78-89, Springer, 2006. [doi]

Abstract

Abstract is missing.