A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph

Pentti A. Honkanen. A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph. In Danny R. Carter, editor, Proceedings of the 15th annual Southeast regional conference, ACM-SE 1977, Hattiesburg, Mississippi, USA, April 18-20, 1977. pages 458-469, ACM, 1977. [doi]

Abstract

Abstract is missing.