Pages that link to "Item:Q4205086"
From MaRDI portal
The following pages link to Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments (Q4205086):
Displayed 12 items.
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A note on the query complexity of the Condorcet winner problem (Q975500) (← links)
- Monocular extraction of 2.1D sketch using constrained convex optimization (Q1799939) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- Tight bounds for finding degrees from the adjacency matrix (Q5096323) (← links)
- ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES (Q5696895) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
- Effective Computation of a Feedback Arc Set Using PageRank (Q6181948) (← links)
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)