BibTeX
@inproceedings{DBLP:conf/wg/GaspersL06,
author = {Serge Gaspers and
Mathieu Liedloff},
title = {A Branch-and-Reduce Algorithm for Finding a Minimum Independent
Dominating Set in Graphs},
booktitle = {WG},
year = {2006},
pages = {78-89},
ee = {http://dx.doi.org/10.1007/11917496_8},
crossref = {DBLP:conf/wg/2006},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/wg/2006,
editor = {Fedor V. Fomin},
title = {Graph-Theoretic Concepts in Computer Science, 32nd International
Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised
Papers},
booktitle = {WG},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4271},
year = {2006},
isbn = {3-540-48381-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2006-11-09 by Michael Ley (ley@uni-trier.de)