Self-transformation of trees with a bounded degree of vertices to minimize or maximize the Wiener index
We consider a distributed network whose communication graph is a non-oriented tree. It is assumed that the network itself can change its topology. For this, an extremely local atomic transformation is proposed - the addition of an edge connecting the different ends of two adjacent edges, and the sim...
Main Author: | Igor Borisovich Burdonov |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2019-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1203 |
Similar Items
-
RESEARCH OF APPROACHES TO THE DEVELOPMENT OF THE ORBITAL COMPUTING NETWORK FOR THE SATELLITE SYSTEM OF INTERNET OF THINGS
by: Михаил Ефимович Ильченко, et al.
Published: (2019-08-01) -
The Linear Inverse Problem of Gravimetry and Magnetometry with Iterative Formulas of Analogs of Wiener-Kalman Filters
by: V. P. Minenko
Published: (2014-06-01) -
Monitoring of dynamically changed graph
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Graph Learning by a Set of Automata. The Nondeterministic Case
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Graph learning by a set of automata
by: Igor Burdonov, et al.
Published: (2018-10-01)