.1 .. • j'S Ie> FINDING A MINIMUM SPANNING TREE CAN BE HARDER THAN A SPANNING TREE IN DISTRIBUTEO NETWORKS i by ,E. Korach, S. Moran and S. Zaks .. Technical Report #294 October 1983 .. •4" .- Technion - Computer Science Department - Technical Report CS0294 - 1983