5 citations · 5 across the 1 of their papers we have counts for
1 paper
Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spa…