Till Tantau. The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters. Electronic Colloquium on Computational Complexity (ECCC), 13(035), 2006. [doi]
@article{Tantau06,
title = {The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters},
author = {Till Tantau},
year = {2006},
url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-035/index.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Tantau06},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {13},
number = {035},
}