1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Mikhail A. Antonets, Grigoriy P. Kogan
In the present paper we consider the problem of constructing all the projective rooted spanning trees of a given graph. We propose an algorithm based on reducing this problem to th…