Maximally pair separated round robin tournaments: ordering the blocks of a design (Q3514486)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5302767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximally pair separated round robin tournaments: ordering the blocks of a design |
scientific article; zbMATH DE number 5302767 |
Statements
21 July 2008
0 references
round robin tournament
0 references
edge separated design
0 references
graph decomposition
0 references
0.835964560508728
0 references
0.8294658064842224
0 references
0.8237854242324829
0 references
0.8161928057670593
0 references
0.8081256151199341
0 references
