Jens Gustedt. Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. In Michel Morvan, Christoph Meinel, Daniel Krob, editors, STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings. Volume 1373 of Lecture Notes in Computer Science, pages 421-431, Springer, 1998.
@inproceedings{Gustedt98:0, title = {Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel}, author = {Jens Gustedt}, year = {1998}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Gustedt98%3A0}, cites = {0}, citedby = {0}, pages = {421-431}, booktitle = {STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings}, editor = {Michel Morvan and Christoph Meinel and Daniel Krob}, volume = {1373}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-64230-7}, }