Counting Various Classes of Tournament Score Sequences
Paul K. Stockmeyer
TL;DR
This paper develops algorithms to count the number of distinct score sequences in specialized classes of tournaments, extending previous methods to self-complementary, strong, and combined tournament types.
Contribution
It introduces new algorithms for counting score sequences in self-complementary and strong tournaments, expanding the scope of known enumeration techniques.
Findings
Algorithms for counting self-complementary tournament score sequences
Algorithms for counting strong tournament score sequences
Algorithms for counting tournaments that are both self-complementary and strong
Abstract
Based on known methods for computing the number of distinct score sequences for -vertex tournaments, we develop algorithms for computing the number of distinct score sequences for self-complementary tournaments, strong tournaments, and tournaments that are both self-complementary and strong.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Scheduling and Timetabling Solutions · Optimization and Search Problems