The complexity of finding generalized paths in tournaments (Q3315014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of finding generalized paths in tournaments |
scientific article; zbMATH DE number 3845072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding generalized paths in tournaments |
scientific article; zbMATH DE number 3845072 |
Statements
The complexity of finding generalized paths in tournaments (English)
0 references
1983
0 references
complexity
0 references
generalized paths
0 references
tournament
0 references
0.8327507376670837
0 references
0.8237221240997314
0 references
0.8038437366485596
0 references
