A toolkit has been developed that allows one to build directed forests from other directed forests. With its help, inequalities are proved, which connect the weights of minimal directed forests with different numbers of trees in them. A theorem on the minimum necessary changes that must be made in the minimal directed forest is also proved in order to obtain another minimal directed forest with the number of roots different by one. Bibliography: 10 titles.
Предметные области Scopus
- Теория вероятности и статистика
- Математика (все)
- Прикладная математика