A Recursive Algorithm to Generate Balanced Weekend Tournaments
Authors: Richard Hoshino
AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present a simple recursive algorithm to answer this question for all even n > 6. As a corollary, our construction gives us an explicit solution to a challenging and well-known graph theory question, namely the problem of decomposing the complete directed graph K 2m into 2m 1 directed Hamiltonian cycles of length 2m. |
| Researcher Affiliation | Academia | Richard Hoshino Quest University Canada, Squamish, British Columbia, Canada |
| Pseudocode | No | The paper describes algorithms through textual explanations and tables but does not present formal pseudocode blocks. |
| Open Source Code | No | The paper does not mention providing open-source code for the described methodology or a link to a code repository. |
| Open Datasets | No | The paper does not use or evaluate on publicly available datasets for training or other experimental purposes. |
| Dataset Splits | No | The paper does not describe empirical experiments or provide details on training, validation, or test dataset splits. |
| Hardware Specification | No | The paper does not specify any hardware used for computations. |
| Software Dependencies | No | The paper does not mention specific software dependencies with version numbers. |
| Experiment Setup | No | The paper does not describe empirical experiments or provide specific details on their setup, such as hyperparameters or training configurations. |