3 papers
math.CO2025
Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
Vasily Buslov
For a weighted digraph without loops , the arc weights of which can be obtained from an undirected graph with loops according to the rule , the p…
math.CO2025
Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
Vasily Buslov
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved…
math.CO2025
When a forest, narrowed to an atom of subset algebra, turns out to be a tree
Vasily Buslov
It is proved that the restriction of a and -component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of tr…