The reversing number of a digraph
From MaRDI portal
Publication:1894351
DOI10.1016/0166-218X(94)00042-CzbMath0826.05032MaRDI QIDQ1894351
Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman, Jean-Pierre Barthelemy
Publication date: 6 September 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (7)
A classification of tournaments having an acyclic tournament as a minimum feedback arc set ⋮ New results on the computation of median orders ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Decomposability index of tournaments ⋮ Cycle reversions and dichromatic number in tournaments ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ NP-hardness results for the aggregation of linear orders into median orders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum cardinality of a consistent set of arcs in a random tournament
- On the maximal order of cyclicity of antisymmetric directed graphs
- Optimally ranking unrankable tournaments
- Parallel concepts in graph theory
- On the degrees of the vertices of a directed graph
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Matrices and Sequences
- On the acyclic subgraph polytope
- Cycles in digraphs– a survey
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- Approximative Algorithms for Discrete Optimization Problems
- On Sets of Consistent Arcs in a Tournament
- Rankings from Paired Comparisons
- Maximum-likelihood paired comparison rankings
- On Sets of Arcs Containing No Cycles in a Tournament*
- Disproof of a conjecture of Erdös and moser on tournaments
- Optimal ranking of tournaments
This page was built for publication: The reversing number of a digraph
