%0 Journal Article
%A V. P. Il'ev
%A A. A. Navrocka
%T Computational complexity of the problem of approximation by graphs with connected components of bounded size
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 80-84
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_3_a5/
%G ru
%F PDM_2011_3_a5