Fabian Wagner. Hardness results for isomorphism and automorphism of bounded valence graphs. In Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková, editors, SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum. pages 131-140, Safarik University, Kosice, Slovakia, 2008.
@inproceedings{Wagner08:3,
title = {Hardness results for isomorphism and automorphism of bounded valence graphs},
author = {Fabian Wagner},
year = {2008},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Wagner08%3A3},
cites = {0},
citedby = {0},
pages = {131-140},
booktitle = {SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum},
editor = {Viliam Geffert and Juhani Karhumäki and Alberto Bertoni and Bart Preneel and Pavol Návrat and Mária Bieliková},
publisher = {Safarik University, Kosice, Slovakia},
isbn = {978-80-7097-697-5},
}