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.
@inproceedings{Lengauer86,
title = {Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs},
author = {Thomas Lengauer},
year = {1986},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Lengauer86},
cites = {0},
citedby = {0},
pages = {153-170},
booktitle = {STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings},
editor = {Burkhard Monien and Guy Vidal-Naquet},
volume = {210},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-16078-7},
}