arXiv (All)
open access
FPT Isomorphism Test for $F$-Free Tournaments
We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the input tournaments. Our result extends on a previous FPT isomorphism test for tournaments of bounded twin-width [Grohe, Neuen 2024], as
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
- La Liga, cada vez más federal: aplicación del problema de Travelling Tournament en la máxima división del básquet profesional en Argentina#268213
- Mixed Tournaments, Common Shocks, and Disincentives: An Experimental Study#499493
- The between competition sprint profile of intercounty female gaelic football during training and match-play: An exploratory study#448474
- Large Language Models and Games: A Survey and Roadmap#328706
- Functional linear models for performance prediction in sport#384817
Record · ID 1051205
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