Geodesic
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Discrete mathematics & theoretical computer science, Tome 14 (2012) no. 1.

Voir la notice de l'article provenant de la source Episciences

Graphs and Algorithms 
@article{DMTCS_2012_14_1_a0,
     author = {Gaspers, Serge and Liedloff, Mathieu},
     title = {A {Branch-and-Reduce} {Algorithm} for {Finding} a {Minimum} {Independent} {Dominating} {Set}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2012},
     doi = {10.46298/dmtcs.563},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.563/}
}
TY  - JOUR
AU  - Gaspers, Serge
AU  - Liedloff, Mathieu
TI  - A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
JO  - Discrete mathematics & theoretical computer science
PY  - 2012
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.563/
DO  - 10.46298/dmtcs.563
LA  - en
ID  - DMTCS_2012_14_1_a0
ER  - 
%0 Journal Article
%A Gaspers, Serge
%A Liedloff, Mathieu
%T A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
%J Discrete mathematics & theoretical computer science
%D 2012
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.563/
%R 10.46298/dmtcs.563
%G en
%F DMTCS_2012_14_1_a0
Gaspers, Serge; Liedloff, Mathieu. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete mathematics & theoretical computer science, Tome 14 (2012) no. 1. doi : 10.46298/dmtcs.563. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.563/

Cité par Sources :