Christof Löding. Ground Tree Rewriting Graphs of Bounded Tree Width. In Helmut Alt, Afonso Ferreira, editors, STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Volume 2285 of Lecture Notes in Computer Science, pages 559-570, Springer, 2002. [doi]
@inproceedings{Loding02,
title = {Ground Tree Rewriting Graphs of Bounded Tree Width},
author = {Christof Löding},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2285/22850559.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Loding02},
cites = {0},
citedby = {0},
pages = {559-570},
booktitle = {STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
editor = {Helmut Alt and Afonso Ferreira},
volume = {2285},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43283-3},
}