|
An optimal problem in graph theory
M. A. Dukhovnyi Krivorozhe Mining Institute
Abstract:
The following problem is solved: determine a point on a tree having the property that the sum of the products of the intensities of its vertices by the corresponding distances to that point is a minimum. The proposed algorithm is reduced to the stepwise application to the tree of truncation of its vertices. A feasible interpretation of the problem is given.
Received: 06.06.1969
Citation:
M. A. Dukhovnyi, “An optimal problem in graph theory”, Mat. Zametki, 10:3 (1971), 355–359; Math. Notes, 10:3 (1971), 636–638
Linking options:
https://www.mathnet.ru/eng/mzm9723 https://www.mathnet.ru/eng/mzm/v10/i3/p355
|
Statistics & downloads: |
Abstract page: | 117 | Full-text PDF : | 65 | First page: | 1 |
|