The structure of minimum-weight directed forests: related forests and convexity inequalities
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part X, Tome 475 (2018), pp. 5-21
Voir la notice de l'article provenant de la source Math-Net.Ru
A toolkit has been developed that allows to build directed forests from another directed forests. this toolkit helps to prove inequalities that connect the weights of minimal directed forests with different numbers of trees in them. Theorem on related forests hoe to transform a the minimal directed forest into another minimal directed forest with the number of roots less or greater by one.
@article{ZNSL_2018_475_a0,
author = {V. A. Buslov},
title = {The structure of minimum-weight directed forests: related forests and convexity inequalities},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {5--21},
publisher = {mathdoc},
volume = {475},
year = {2018},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2018_475_a0/}
}
TY - JOUR AU - V. A. Buslov TI - The structure of minimum-weight directed forests: related forests and convexity inequalities JO - Zapiski Nauchnykh Seminarov POMI PY - 2018 SP - 5 EP - 21 VL - 475 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZNSL_2018_475_a0/ LA - ru ID - ZNSL_2018_475_a0 ER -
V. A. Buslov. The structure of minimum-weight directed forests: related forests and convexity inequalities. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part X, Tome 475 (2018), pp. 5-21. http://geodesic.mathdoc.fr/item/ZNSL_2018_475_a0/