Constructive Quasi-Ramsey Numbers and Tournament Ranking
From MaRDI portal
Publication:4255807
Recommendations
- Tournament Ranking with Expected Profit in Polynomial Time
- A constructive solution to a problem of ranking tournaments
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- scientific article; zbMATH DE number 1855678
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Cited in
(17)- Maximum dispersion problem in dense graphs
- Packing triangles in regular tournaments
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Packing and Covering a Given Directed Graph in a Directed Graph
- Partitioning problems in dense hypergraphs
- Voting procedures, complexity of
- Integer and fractional packings of hypergraphs
- On characterizing hypergraph regularity
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Intersections of random hypergraphs and tournaments
- Packing edge-disjoint triangles in regular and almost regular tournaments
- Packing directed cycles efficiently
- An improved MST algorithm for ranking players of a round-robin tournament
- A survey on the linear ordering problem for weighted or unweighted tournaments
- An application of the Ramsey theorem to ordered r-tournaments
- Almost given length cycles in digraphs
This page was built for publication: Constructive Quasi-Ramsey Numbers and Tournament Ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255807)
