![]() |
@article{DBLP:journals/dam/KeilS06,
author = {J. Mark Keil and
Lorna Stewart},
title = {Approximating the minimum clique cover and other hard problems
in subtree filament graphs},
journal = {Discrete Applied Mathematics},
volume = {154},
number = {14},
year = {2006},
pages = {1983-1995},
ee = {http://dx.doi.org/10.1016/j.dam.2006.03.003},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2007-03-16 by Michael Ley (ley@uni-trier.de)