One-way infinite sequences in a graph and the optimal allocation of identical figures in an infinite narrow strip
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 19 (1979) no. 5, pp. 1304-1312
Cet article a éte moissonné depuis la source Math-Net.Ru
Infinite routes in finite flow graphs are considered. Algorithms for finding routes with minimal mean path length are presented. The results are applied to the problem of the densest allocation of identical figures in an infinite strip.
@article{ZVMMF_1979_19_5_a19,
author = {G. N. Pyatnitskaya and I. G. Sinitsyn},
title = {One-way infinite sequences in a~graph and the optimal allocation of identical figures in an infinite narrow strip},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1304--1312},
year = {1979},
volume = {19},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1979_19_5_a19/}
}
TY - JOUR AU - G. N. Pyatnitskaya AU - I. G. Sinitsyn TI - One-way infinite sequences in a graph and the optimal allocation of identical figures in an infinite narrow strip JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1979 SP - 1304 EP - 1312 VL - 19 IS - 5 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1979_19_5_a19/ LA - ru ID - ZVMMF_1979_19_5_a19 ER -
%0 Journal Article %A G. N. Pyatnitskaya %A I. G. Sinitsyn %T One-way infinite sequences in a graph and the optimal allocation of identical figures in an infinite narrow strip %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 1979 %P 1304-1312 %V 19 %N 5 %U http://geodesic.mathdoc.fr/item/ZVMMF_1979_19_5_a19/ %G ru %F ZVMMF_1979_19_5_a19
G. N. Pyatnitskaya; I. G. Sinitsyn. One-way infinite sequences in a graph and the optimal allocation of identical figures in an infinite narrow strip. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 19 (1979) no. 5, pp. 1304-1312. http://geodesic.mathdoc.fr/item/ZVMMF_1979_19_5_a19/