2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
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…