Pages that link to "Item:Q5963652"
From MaRDI portal
The following pages link to Algorithms for finding maximum transitive subtournaments (Q5963652):
Displaying 5 items.
- Coloring the nodes of a directed graph (Q399510) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- An optimal algorithm for finding all convex subsets in tournaments (Q2760997) (← links)
- Design, implementation, and analysis of maximum transversal algorithms (Q2989152) (← links)