Pages that link to "Item:Q1192953"

The following pages link to A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953):

Displaying 10 items.

• Sublinear-time algorithms for tournament graphs (Q652634) (← links)
• A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
• Polynomial time recognition and testing of isomorphism of cyclic tournaments (Q1190955) (← links)
• Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
• Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter (Q2243313) (← links)
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
• Finding an Oriented Hamiltonian Path in a Tournament (Q4500855) (← links)
• Sparse Spanning $k$-Connected Subgraphs in Tournaments (Q5361237) (← links)
• NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)