Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth. In Joanna Jedrzejowicz, Andrzej Szepietowski, editors, Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings. Volume 3618 of Lecture Notes in Computer Science, pages 364-375, Springer, 2005. [doi]
@inproceedings{FominFN05,
title = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},
author = {Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse},
year = {2005},
doi = {10.1007/11549345_32},
url = {http://dx.doi.org/10.1007/11549345_32},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/FominFN05},
cites = {0},
citedby = {0},
pages = {364-375},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings},
editor = {Joanna Jedrzejowicz and Andrzej Szepietowski},
volume = {3618},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-28702-7},
}