A common algorithm for graph-interpretable games - Collections

＜departmental bulletin paper＞
A common algorithm for graph-interpretable games

Creator	Creator Name Haraguchi, Makoto 原口, 誠
Language	English
Publisher	Faculty of Science, Kyushu University
Publisher	九州大学理学部
Date	1977-09-25
Source Title	Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
Vol	31
Issue	2
First Page	259
Last Page	266
Publication Type	Version of Record
Access Rights	restricted access
Related DOI	isIdenticalTo https://doi.org/10.2206/kyushumfs.31.259
Related DOI	Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics \|\| 31(2) \|\| p259-266
	九州大学理学部紀要 \|\| 31(2) \|\| p259-266
	http://www.math.kyushu-u.ac.jp/
Related URI	Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics \|\| 31(2) \|\| p259-266
	九州大学理学部紀要 \|\| 31(2) \|\| p259-266
	http://www.math.kyushu-u.ac.jp/
Related URI
Related HDL
Relation	Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics \|\| 31(2) \|\| p259-266
	九州大学理学部紀要 \|\| 31(2) \|\| p259-266
	http://www.math.kyushu-u.ac.jp/
Abstract	Winning Strategies of graph-interpretable games can be obtained by using "Kernels" of underlying graphs. S.A. Dunning has considered canonical forms of given game graphs which are full subgraphs of th...e "universal game". This gives light to the theoretical approach to games. This paper presents a common algorithm for game graphs.show more