On linear programming duality and Landau's characterization of tournament
From MaRDI portal
Publication:399504
DOI10.2478/ausi-2014-0016zbMath1297.05097OpenAlexW2159889442MaRDI QIDQ399504
Publication date: 19 August 2014
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausi-2014-0016
Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
To stay discovered: on tournament mean score sequences and the Bradley-Terry model ⋮ Some Combinatorially Defined Matrix Classes ⋮ Tournaments associated with multigraphs and a theorem of Hakimi
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Score vectors of tournaments
- An elementary proof of Moon's theorem on generalized tournaments
- Bruhat order of tournaments
- An extension of Landau's theorem on tournaments
- Systems of Distinct Representations and Linear Programming
- Linear Inequalities and Related Systems. (AM-38)
- Matrices of zeros and ones
- On the Score Sequence of an N-Partite Tournament
- Matrices and Sequences
- Characterization of Totally Unimodular Matrices
- Upsets in Round Robin Tournaments
- The Theory of Round Robin Tournaments
- A new proof of a theorem by H. G. Landau on tournament matrices
This page was built for publication: On linear programming duality and Landau's characterization of tournament