Geodesic
On the complexity of the realization of Boolean matrices with a connected boundary
Diskretnaya Matematika, Tome 7 (1995) no. 1, pp. 19-51.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DM_1995_7_1_a1,
     author = {I. R. Khaverlik},
     title = {On the complexity of the realization of {Boolean} matrices with a connected boundary},
     journal = {Diskretnaya Matematika},
     pages = {19--51},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1995_7_1_a1/}
}
TY  - JOUR
AU  - I. R. Khaverlik
TI  - On the complexity of the realization of Boolean matrices with a connected boundary
JO  - Diskretnaya Matematika
PY  - 1995
SP  - 19
EP  - 51
VL  - 7
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1995_7_1_a1/
LA  - ru
ID  - DM_1995_7_1_a1
ER  - 
%0 Journal Article
%A I. R. Khaverlik
%T On the complexity of the realization of Boolean matrices with a connected boundary
%J Diskretnaya Matematika
%D 1995
%P 19-51
%V 7
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1995_7_1_a1/
%G ru
%F DM_1995_7_1_a1
I. R. Khaverlik. On the complexity of the realization of Boolean matrices with a connected boundary. Diskretnaya Matematika, Tome 7 (1995) no. 1, pp. 19-51. http://geodesic.mathdoc.fr/item/DM_1995_7_1_a1/