2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2025
Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
V. A. Buslov
A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does…
cs.DM2008★ 2 cited
On the Minimum Spanning Tree for Directed Graphs with Potential Weights
V. A. Buslov, V. A. Khudobakhshov
In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and…