Pages that link to "Item:Q3315014"
From MaRDI portal
The following pages link to The complexity of finding generalized paths in tournaments (Q3315014):
Displaying 15 items.
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Antidirected Hamiltonian paths between specified vertices of a tournament (Q1348380) (← links)
- A structured family of clustering and tree construction methods (Q1604343) (← 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)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- (Q3153144) (← links)
- The complexity of finding certain trees in tournaments (Q5060108) (← links)
- Tight bounds for finding degrees from the adjacency matrix (Q5096323) (← links)
- ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES (Q5696895) (← links)
- Path decompositions of tournaments (Q6075058) (← links)
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)
- Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament (Q6567672) (← links)
