@article{FRAENKEL1993197,
    Abstract = {Generalized Geography is an impartial two-person game played on a digraph G=(V,A). In impartial Arc (Vertex) Geography, a token is initially placed on a special start vertex, and the players alternately move the token along unused arcs (vertices) of G. The player first unable to move loses and his opponent wins. The question of who wins these games IAG and IVG is known to be PSPACE-complete. Both impartial versions with two tokens on special start vertices are proved PSPACE-complete even for DAGs but polynomial for directed trees. The partizan variations, PAG and PVG, with one token per player are PSPACE-complete even for bipartite degree-restricted digraphs. They are NP-hard for DAGs, but polynomial for directed trees.},
    Author = {Fraenkel, A.S. and Simonson, S.},
    File = {1-s2.0-030439759390356X-main (0) (0) - a - a - o.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Number = {1},
    Pages = {197 - 214},
    Title = {Geography},
    URL = {http://www.sciencedirect.com/science/article/pii/030439759390356X},
    Volume = {110},
    Year = {1993},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439759390356X},
    bdsk-url-2 = {https://doi.org/10.1016/0304-3975(93)90356-X},
    date-added = {2019-03-26 20:50:03 +0100},
    date-modified = {2019-03-26 20:50:03 +0100},
    doi = {10.1016/0304-3975(93)90356-X}
}

@article{FRAENKEL1993197, Abstract = {Generalized Geography is an impartial two-person game played on a digraph G=(V,A). In impartial Arc (Vertex) Geography, a token is initially placed on a special start vertex, and the players alternately move the token along unused arcs (vertices) of G. The player first unable to move loses and his opponent wins. The question of who wins these games IAG and IVG is known to be PSPACE-complete. Both impartial versions with two tokens on special start vertices are proved PSPACE-complete even for DAGs but polynomial for directed trees. The partizan variations, PAG and PVG, with one token per player are PSPACE-complete even for bipartite degree-restricted digraphs. They are NP-hard for DAGs, but polynomial for directed trees.}, Author = {Fraenkel, A.S. and Simonson, S.}, File = {1-s2.0-030439759390356X-main (0) (0) - a - a - o.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Number = {1}, Pages = {197 - 214}, Title = {Geography}, URL = {http://www.sciencedirect.com/science/article/pii/030439759390356X}, Volume = {110}, Year = {1993}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439759390356X}, bdsk-url-2 = {https://doi.org/10.1016/0304-3975(93)90356-X}, date-added = {2019-03-26 20:50:03 +0100}, date-modified = {2019-03-26 20:50:03 +0100}, doi = {10.1016/0304-3975(93)90356-X} }