The problem of synthesizing a reliable Kirchhoff network on a graph
News of the Kabardin-Balkar scientific center of RAS, no. 2 (2003), pp. 17-22
Voir la notice de l'article provenant de la source Math-Net.Ru
A method for synthesizing a reliable stationary network with a single source is proposed, the operation of which is subject to equations similar to Kirchhoff’s equations for a direct current circuit. The method is based on reducing network optimization to optimization of its small, specially selected fragments.
Keywords:
synthesis problem, Kirchhoff network, graph
@article{IZKAB_2003_2_a0,
author = {V. Ch. Kudaev},
title = {The problem of synthesizing a reliable {Kirchhoff} network on a graph},
journal = {News of the Kabardin-Balkar scientific center of RAS},
pages = {17--22},
publisher = {mathdoc},
number = {2},
year = {2003},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IZKAB_2003_2_a0/}
}
V. Ch. Kudaev. The problem of synthesizing a reliable Kirchhoff network on a graph. News of the Kabardin-Balkar scientific center of RAS, no. 2 (2003), pp. 17-22. http://geodesic.mathdoc.fr/item/IZKAB_2003_2_a0/