Pages that link to "Item:Q3786504"
From MaRDI portal
The following pages link to Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (Q3786504):
Displayed 6 items.
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953) (← links)
- Antidirected Hamiltonian paths between specified vertices of a tournament (Q1348380) (← links)
- The Hamilton circuit problem on grids (Q4365024) (← links)
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (Q4842704) (← links)
- ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES (Q5696895) (← links)