Ranking Tournaments
From MaRDI portal
Publication:5470822
DOI10.1137/050623905zbMath1112.05043OpenAlexW2913028927MaRDI QIDQ5470822
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3cbb2f7a2cfefc842505fc34f7c7702c156d19ee
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Comparison-based interactive collaborative filtering, Binets: fundamental building blocks for phylogenetic networks, Parameterized algorithms for feedback set problems and their duals in tournaments, Ranking chain sum orders, Parameterizing edge modification problems above lower bounds, Unnamed Item, Feedback arc set in bipartite tournaments is NP-complete, Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists, Feedback arc set problem in bipartite tournaments, Comparison-Based Interactive Collaborative Filtering, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Hardness of fully dense problems, Additive approximation for edge-deletion problems, Label ranking by learning pairwise preferences, A survey on the linear ordering problem for weighted or unweighted tournaments, Robust Learning of Consumer Preferences, Decomposability index of tournaments, The complexity of computing minimal unidirectional covering sets, Packing arc-disjoint cycles in tournaments, A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments, Recurring Comparison Faults: Sorting and Finding the Minimum, Comparing multiagent systems research in combinatorial auctions and voting, An Exact Method for the Minimum Feedback Arc Set Problem, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number, Extremal results on feedback arc sets in digraphs, Invertibility of Digraphs and Tournaments, Beyond the worst case: semi-random complexity analysis of winner determination, On the computation of median linear orders, of median complete preorders and of median weak orders, Preference-based learning to rank, Kernels for feedback arc set in tournaments, Minimal retentive sets in tournaments, Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs, Voting Procedures, Complexity of, Computing the minimal covering set, Directed Graphs Without Short Cycles, The minimum feedback arc set problem and the acyclic disconnection for graphs, A computational analysis of the tournament equilibrium set, A quadratic vertex kernel for feedback arc set in bipartite tournaments, A tournament of order 14 with disjoint Banks and Slater sets, Unnamed Item, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Fixed-parameter tractability results for feedback set problems in tournaments, New results on optimizing rooted triplets consistency, NP-hardness results for the aggregation of linear orders into median orders, Exact localisations of feedback sets, Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem, Ranking tournaments with no errors. I: Structural description, Monocular extraction of 2.1D sketch using constrained convex optimization, Robust reductions from ranking to classification, The Computational Complexity of Choice Sets, Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number, Packing Arc-Disjoint Cycles in Tournaments, \(k\)-majority digraphs and the hardness of voting with a constant number of voters, Hardness of edge-modification problems, A survey on the complexity of tournament solutions, On the complexity of Slater's problems, All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight), Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, A constructive solution to a problem of ranking tournaments, Tournaments and Semicomplete Digraphs, On predictive accuracy and risk minimization in pairwise label ranking, Time-homogeneous top-K ranking using tensor decompositions, On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments, Bounds on the disparity and separation of tournament solutions, Complexity results for extensions of median orders to different types of remoteness
