TY  - JOUR
AU  - O. I. Duginov
TI  - The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
JO  - Trudy Instituta matematiki
PY  - 2014
SP  - 51
EP  - 69
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMB_2014_22_1_a4/
LA  - ru
ID  - TIMB_2014_22_1_a4
ER  -