(2026). Finding forest-orderings of tournaments is NP-complete. Discrete Mathematics & Theoretical Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Finding Forest-orderings of Tournaments Is NP-complete."
Discrete Mathematics & Theoretical Computer Science 2026.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Finding Forest-orderings of Tournaments Is NP-complete."
Discrete Mathematics & Theoretical Computer Science, 2026.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.