Thomas Lengauer, Klaus W. Wagner. The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. In Franz-Josef Brandenburg, Guy Vidal-Naquet, Martin Wirsing, editors, STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings. Volume 247 of Lecture Notes in Computer Science, pages 100-113, Springer, 1987.
@inproceedings{LengauerW87,
title = {The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems},
author = {Thomas Lengauer and Klaus W. Wagner},
year = {1987},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LengauerW87},
cites = {0},
citedby = {0},
pages = {100-113},
booktitle = {STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings},
editor = {Franz-Josef Brandenburg and Guy Vidal-Naquet and Martin Wirsing},
volume = {247},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-17219-X},
}