Pages that link to "Item:Q1208466"
From MaRDI portal
The following pages link to Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466):
Displaying 11 items.
- Sublinear-time algorithms for tournament graphs (Q652634) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953) (← links)
- In-tournament digraphs (Q1322037) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments (Q3605164) (← links)
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs (Q3990618) (← links)
- Finding an Oriented Hamiltonian Path in a Tournament (Q4500855) (← links)
- The complexity of finding certain trees in tournaments (Q5060108) (← links)
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)