Ranking tournaments with no errors. I: Structural description

DOI10.1016/J.JCTB.2019.08.004MaRDI QIDQ2284746zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Wenan Zang, Xujin Chen, Qiu-Lan Zhao

Publication date 15 January 2020

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2019.08.004

zbMATH Keywords

characterizationcycle packingfeedback arc setminimax relationtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Paths and cycles (05C38) Applications of graph theory (05C90)

Recommendations

• Ranking tournaments with no errors. II: Minimax relation
• Tournaments as feedback arc sets
• Ranking Tournaments
• On the Minimum Violations Ranking of a Tournament
• A Min-Max Theorem on Tournaments

Cites work

• A 7/3-approximation for feedback vertex sets in tournaments
• A Minimax Theorem for Directed Graphs
• A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
• Aggregating inconsistent information: ranking and clustering
• An approximation algorithm for feedback vertex sets in tournaments
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Deterministic pivoting algorithms for constrained ranking and clustering problems
• Deterministic pivoting algorithms for constrained ranking and clustering problems
• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 1762085 (Why is no real title available?)
• Integral infeasibility and testing total dual integrality
• On Sets of Consistent Arcs in a Tournament
• On the Minimum Violations Ranking of a Tournament
• Optimal ranking of tournaments
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Packing circuits in eulerian digraphs
• Packing cycles in graphs
• Packing cycles in graphs. II
• Packing directed circuits exactly
• Packing odd circuits in Eulerian graphs
• Ranking Tournaments
• The ellipsoid method and its consequences in combinatorial optimization
• The matroids with the max-flow min-cut property
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Upsets in Round Robin Tournaments

Cited in

(7)

• Tournaments as feedback arc sets
• Ranking tournaments with no errors. II: Minimax relation
• A constructive solution to a problem of ranking tournaments
• An alternative interpretation of random noise in rank-order tournaments
• On the Minimum Violations Ranking of a Tournament
• Ranking Tournaments
• Packing Feedback Arc Sets in Tournaments Exactly

This page was built for publication: Ranking tournaments with no errors. I: Structural description

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284746)