Geodesic
Application of graphs to the Gaussian elimination method
Zapiski Nauchnykh Seminarov POMI, Computational methods and automatic programming, Tome 58 (1976), pp. 72-79 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

Certain algebraic operations (in the Boolean sense) are developed for directed graphs. Nonsingular and inverse graphs are defined and some of their characteristics are derived. The results are applied for the Gaussian elimination process. 
@article{ZNSL_1976_58_a8,
     author = {M. Fidler},
     title = {Application of graphs to the {Gaussian} elimination method},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {72--79},
     year = {1976},
     volume = {58},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a8/}
}
TY  - JOUR
AU  - M. Fidler
TI  - Application of graphs to the Gaussian elimination method
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1976
SP  - 72
EP  - 79
VL  - 58
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a8/
LA  - ru
ID  - ZNSL_1976_58_a8
ER  - 
%0 Journal Article
%A M. Fidler
%T Application of graphs to the Gaussian elimination method
%J Zapiski Nauchnykh Seminarov POMI
%D 1976
%P 72-79
%V 58
%U http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a8/
%G ru
%F ZNSL_1976_58_a8
M. Fidler. Application of graphs to the Gaussian elimination method. Zapiski Nauchnykh Seminarov POMI, Computational methods and automatic programming, Tome 58 (1976), pp. 72-79. http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a8/