|
Avtomatika i Telemekhanika, 1984, Issue 4, Pages 128–138
(Mi at4673)
|
|
|
|
Automated control systems
Network decomposition into minimally linked parts
A. B. Boronin, O. Yu. Pershin Moscow
Abstract:
The paper is concerned with decomposition of a weighed graph into subgraphs, minimally linked in terms of the sum of weights of external edges, a problem regarded as obtaining a multicomponent network of a desired graph structure on a specified network. The proposed solution algorithm proceeds by implicit selection and employs an adaptive strategy of motion along the branching tree and the extimate construction principle.
Received: 29.10.1982
Citation:
A. B. Boronin, O. Yu. Pershin, “Network decomposition into minimally linked parts”, Avtomat. i Telemekh., 1984, no. 4, 128–138; Autom. Remote Control, 45:4 (1984), 519–528
Linking options:
https://www.mathnet.ru/eng/at4673 https://www.mathnet.ru/eng/at/y1984/i4/p128
|
Statistics & downloads: |
Abstract page: | 95 | Full-text PDF : | 52 | First page: | 2 |
|