New results on the computation of median orders

DOI10.1016/S0012-365X(96)00166-5zbMath0878.68090OpenAlexW1965752728MaRDI QIDQ1356737

Irène Charon, Frédéric Woirgard, Olivier Hudry, Alain Guénoche

Publication date: 14 December 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00166-5

zbMATH Keywords

digraphsfeedback arc set problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Approximate and dynamic rank aggregation ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Maximum distance between Slater orders and Copeland orders of tournaments ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Voting Procedures, Complexity of ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture ⋮ A new approach for identifying the Kemeny median ranking

Cites Work

• Median linear orders: Heuristics and a branch and bound algorithm
• Covering relations, closest orderings and Hamiltonian bypaths in tournaments
• The median procedure in cluster analysis and social choice theory
• The reversing number of a digraph
• Graphs with forbidden subgraphs
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• Maximum-likelihood paired comparison rankings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New results on the computation of median orders