RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive
Zh. Vychisl. Mat. Mat. Fiz., 1979 Volume 19, Number 5, Pages 1304–1312 (Mi zvmmf5310)
This article is cited 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.

UDC: 519.17

MSC: Primary 05C20; Secondary 05C35, 05C38

Received: 17.04.1978


 English version: USSR Computational Mathematics and Mathematical Physics, 1979, 19:5, 219–227

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024