Detlef Seese. Tree-partite graphs and the complexity of algorithms. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 412-421, Springer, 1985.
@inproceedings{Seese85,
title = {Tree-partite graphs and the complexity of algorithms},
author = {Detlef Seese},
year = {1985},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Seese85},
cites = {0},
citedby = {0},
pages = {412-421},
booktitle = {Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985},
editor = {Lothar Budach},
volume = {199},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-15689-5},
}