arXiv (All)
open access
Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width
Directed Edge Geography and Undirected Edge Geography are classical PSPACE-complete two-player graph games in which players alternately make moves along edges, deleting each one after use; the first player unable to move loses. We prove that both problems are XNLP-hard when parameterized by pathwidt
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Category Gm for Extensive-Form Games#997879
- Extremal graphs for disjoint union of stars and paths#616674
- Extremal graphs for disjoint union of stars and paths#616174
- DP vertex-arboricity of sparse graphs#1117503
- Sequential game dynamics produce subgame perfect equilibria in sports networks through bounded rationality.#615851
Record · ID 985164
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive