| Article ID: | iaor19931493 |
| Country: | United Kingdom |
| Volume: | 31 |
| Start Page Number: | 102 |
| End Page Number: | 104 |
| Publication Date: | Jan 1991 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Mikheyev Yu.M. |
A method is considered for link construction (routing) based on the properties of a mapping of a multilobed graph formed by regularly situated elements together with their links into a lattice graph which represents the installation space. The construction is performed via the sequential solution of combinatorial problems.