Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments (Q3201091)
From MaRDI portal
!
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 4177103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments |
scientific article; zbMATH DE number 4177103 |
Statements
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments (English)
0 references
1990
0 references
algorithms
0 references
finding Hamiltonian cycles
0 references
bipartite tournament
0 references
finding Hamiltonian paths
0 references
finding cycles
0 references
0.8261051774024963
0 references
0.8237529397010803
0 references
0.821764349937439
0 references
0.8212236762046814
0 references
0.8197734355926514
0 references
