A graphical way to solve the Boolean matrix equations $AX=B$ and $XA=B$
Kybernetika, Tome 10 (1974) no. 1, pp. 61-65
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1974_10_1_a4,
author = {Nieminen, U. J.},
title = {A graphical way to solve the {Boolean} matrix equations $AX=B$ and $XA=B$},
journal = {Kybernetika},
pages = {61--65},
year = {1974},
volume = {10},
number = {1},
mrnumber = {0351648},
zbl = {0273.15013},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1974_10_1_a4/}
}
Nieminen, U. J. A graphical way to solve the Boolean matrix equations $AX=B$ and $XA=B$. Kybernetika, Tome 10 (1974) no. 1, pp. 61-65. http://geodesic.mathdoc.fr/item/KYB_1974_10_1_a4/
[1] S. T. Hedetniemi: Graphs of $(0, 1)$-matrices. In: Recent Trends in Graph Theory (ed. by M. Capobianco, J. B. Frechen, and M. Krolik). Springer-Verlag, Berlin-Heidelberg- New York 1971, 157-171. | MR | Zbl
[2] R. S. Ledley: Digital computer and control engineering. McGraw-Hill, New York-Toronto-London 1960.
[3] R. S. Ledley: Programming and utilizing digital computers. McGraw-Hill, New York-Toronto-London 1962. | Zbl
[4] S. Rudeanu: On Boolean matrix equations. Rev. Roum. Math. Pures et Appl. XVII (1972), 7, 1075-1090. | MR | Zbl