Algorithms and complexity of graph convexity partizan games

DOI10.1016/J.TCS.2025.115267MaRDI QIDQ6985816zbMATH OpenFDO

Authors Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph convexitycombinatorial game theorysurreal numberspartizan gamesPSPACE-hardnessgeodesic games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

This page was built for publication: Algorithms and complexity of graph convexity partizan games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985816)