Geodesic
A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2020), pp. 14-19

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

Some algorithms for transitive closure and Boolean matrix multiplication are compared. The bounds for size and depth of corresponding boolean circuits are given. 
@article{VMUMM_2020_6_a1,
     author = {S. B. Gashkov},
     title = {A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {14--19},
     publisher = {mathdoc},
     number = {6},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2020_6_a1/}
}
TY  - JOUR
AU  - S. B. Gashkov
TI  - A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2020
SP  - 14
EP  - 19
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2020_6_a1/
LA  - ru
ID  - VMUMM_2020_6_a1
ER  - 
%0 Journal Article
%A S. B. Gashkov
%T A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2020
%P 14-19
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2020_6_a1/
%G ru
%F VMUMM_2020_6_a1
S. B. Gashkov. A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2020), pp. 14-19. http://geodesic.mathdoc.fr/item/VMUMM_2020_6_a1/