Sciweavers

TALG
2008

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

13 years 10 months ago
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TALG
Authors Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
Comments (0)