|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1979, Volume 19, Number 5, Pages 1304–1312
(Mi zvmmf5310)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
One-way infinite sequences in a graph and the optimal allocation of identical figures in an infinite narrow strip
G. N. Pyatnitskaya, I. G. Sinitsyn Moskva
Abstract:
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.
Received: 17.04.1978
Citation:
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”, Zh. Vychisl. Mat. Mat. Fiz., 19:5 (1979), 1304–1312; U.S.S.R. Comput. Math. Math. Phys., 19:5 (1979), 219–227
Linking options:
https://www.mathnet.ru/eng/zvmmf5310 https://www.mathnet.ru/eng/zvmmf/v19/i5/p1304
|
Statistics & downloads: |
Abstract page: | 193 | Full-text PDF : | 92 | First page: | 1 |
|