Pages that link to "Item:Q3786504"

The following pages link to Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (Q3786504):

Displaying 9 items.

• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
• 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)
• Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
• The Hamilton circuit problem on grids (Q4365024) (← links)
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (Q4842704) (← links)
• The watchman's walk problem on directed graphs (Q5000299) (← links)
• ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES (Q5696895) (← links)