Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs

Thomas Lengauer. Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. In Burkhard Monien, Guy Vidal-Naquet, editors, STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings. Volume 210 of Lecture Notes in Computer Science, pages 153-170, Springer, 1986.

Abstract

Abstract is missing.