Hajime Ishihara, Bakhadyr Khoussainov. Complexity of Some Infinite Games Played on Finite Graphs. In Ludek Kucera, editor, Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Volume 2573 of Lecture Notes in Computer Science, pages 270-281, Springer, 2002. [doi]
@inproceedings{IshiharaK02:0,
title = {Complexity of Some Infinite Games Played on Finite Graphs},
author = {Hajime Ishihara and Bakhadyr Khoussainov},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2573/25730270.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/IshiharaK02%3A0},
cites = {0},
citedby = {0},
pages = {270-281},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers},
editor = {Ludek Kucera},
volume = {2573},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00331-2},
}