{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:21:29Z","timestamp":1759335689787},"reference-count":38,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0166-218x(94)00042-c","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"39-76","source":"Crossref","is-referenced-by-count":10,"title":["The reversing number of a diagraph"],"prefix":"10.1016","volume":"60","author":[{"given":"Jean-Pierre","family":"Barth\u00e9lemy","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Hudry","sequence":"additional","affiliation":[]},{"given":"Garth","family":"Isaak","sequence":"additional","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]},{"given":"Barry","family":"Tesman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00042-C_BIB1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.2307\/3614018","article-title":"Matrices and sequences","volume":"46","author":"Alway","year":"1962","journal-title":"Math. Gaz."},{"key":"10.1016\/0166-218X(94)00042-C_BIB2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1111\/j.2044-8317.1977.tb00735.x","article-title":"Applications of combinatorial programming to data analysis: seriation using asymmetric proximity measures","volume":"30","author":"Baker","year":"1977","journal-title":"British J. Math. Statist. Psych."},{"key":"10.1016\/0166-218X(94)00042-C_BIB3","series-title":"DIMACS Technical Report 91-22","article-title":"The reversing number of a diagraph","author":"Barth\u00e9lemy","year":"1991"},{"key":"10.1016\/0166-218X(94)00042-C_BIB4","first-page":"5","article-title":"Ordres a distance minimum d'un tournoi et graphes partiels sans circuits maximaux","volume":"37","author":"Bermond","year":"1972","journal-title":"Math. Sci. Humaines"},{"key":"10.1016\/0166-218X(94)00042-C_BIB5","first-page":"165","article-title":"The circuit-hypergraph of a tournament","volume":"10","author":"Bermond","year":"1975"},{"key":"10.1016\/0166-218X(94)00042-C_BIB6","first-page":"83","article-title":"Une heuristic pour le calcul de l'indice de transitivite d'un tournoi","volume":"10","author":"Bermond","year":"1976","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0166-218X(94)00042-C_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190050102","article-title":"Cycles in diagraphs \u2014 a survey","volume":"5","author":"Bermond","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB8","series-title":"Graph Theory: An Introductory Course","author":"Bollab\u00e1s","year":"1979"},{"key":"10.1016\/0166-218X(94)00042-C_BIB9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0095-8956(83)90060-6","article-title":"On the maximum cardinality of a consistent set of arcs in a random tournament","volume":"35","author":"de la Vega","year":"1983","journal-title":"J. Combin Theory Ser. B."},{"key":"10.1016\/0166-218X(94)00042-C_BIB10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.4153\/CMB-1965-017-1","article-title":"On sets of consistent arcs in a tournament","volume":"8","author":"Erdős","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0166-218X(94)00042-C_BIB11","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","article-title":"A cutting plane algorithm for the linear ordering problem","volume":"32","author":"Gr\u00f6tschel","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)00042-C_BIB12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","article-title":"Facets of the linear ordering polytope","volume":"33","author":"Gr\u00f6tschel","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00042-C_BIB13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","article-title":"On the degrees of the vertices of a directed graph","volume":"279","author":"Hakimi","year":"1965","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0166-218X(94)00042-C_BIB14","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/0166-218X(94)00042-C_BIB15","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1109\/TCS.1975.1083970","article-title":"On minimal feedback vertex sets of a digraph","volume":"22","author":"Harary","year":"1975","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1111\/j.2044-8317.1976.tb00701.x","article-title":"Seriation using asymmetric proximity measures","volume":"29","author":"Hubert","year":"1976","journal-title":"British J. Math. Statist. Psych."},{"key":"10.1016\/0166-218X(94)00042-C_BIB17","first-page":"115","article-title":"The weighted reversing number of a digraph","volume":"83","author":"Isaak","year":"1991","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(94)00042-C_BIB18","series-title":"Polyhedral Combinatories and the Acyclic Subdigraph Problem","author":"J\u00fcnger","year":"1985"},{"key":"10.1016\/0166-218X(94)00042-C_BIB19","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TCT.1967.1082661","article-title":"Notes on a minimum feedback arc set","volume":"14","author":"Kamae","year":"1967","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB20","series-title":"Complexity of Computer Computation","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(94)00042-C_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0167-5060(08)70820-3","article-title":"Approximative algorithms for discrete optimization problems","volume":"4","author":"Korte","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)00042-C_BIB22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(75)90092-8","article-title":"On the maximal order of cyclicity of antisymmetric directed graphs","volume":"12","author":"Kotzig","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00042-C_BIB23","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/TCT.1964.1082291","article-title":"A comment on minimum feedback arc sets","volume":"11","author":"Lawler","year":"1964","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TCT.1966.1082620","article-title":"Minimum feedback arc and vertex sets of a directed graph","volume":"13","author":"Lempel","year":"1966","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB25","first-page":"55","article-title":"Tournois et ordres m\u00e9dians pour une opinion","volume":"43","author":"Monjardet","year":"1973","journal-title":"Math. Sci. Humaines"},{"key":"10.1016\/0166-218X(94)00042-C_BIB26","series-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/0166-218X(94)00042-C_BIB27","doi-asserted-by":"crossref","first-page":"261","DOI":"10.4153\/CMB-1969-032-x","article-title":"On sets of arcs containing no cycles in tournaments","volume":"12","author":"Reid","year":"1969","journal-title":"Canad. Math Bull."},{"key":"10.1016\/0166-218X(94)00042-C_BIB28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0021-9800(70)80061-8","article-title":"Disproof of a conjecture of Erdős and Moser on tournaments","volume":"9","author":"Reid","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1093\/biomet\/53.1-2.143","article-title":"Maximum-likelihood paired comparison rankings","volume":"53","author":"Remage","year":"1966","journal-title":"Biometrika"},{"key":"10.1016\/0166-218X(94)00042-C_BIB30","series-title":"Applied Combinatorics","author":"Roberts","year":"1984"},{"key":"10.1016\/0166-218X(94)00042-C_BIB31","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","year":"1961"},{"key":"10.1016\/0166-218X(94)00042-C_BIB32","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","article-title":"Inconsistencies in a schedule of paired comparisons","volume":"48","author":"Slater","year":"1961","journal-title":"Biometrika"},{"key":"10.1016\/0166-218X(94)00042-C_BIB33","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230010204","article-title":"Optimal ranking of tournaments","volume":"1","author":"Spencer","year":"1971","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)00042-C_BIB34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02017965","article-title":"Optimally ranking unrankable tournaments","volume":"11","author":"Spencer","year":"1980","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/0166-218X(94)00042-C_BIB35","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1214\/aoms\/1177703572","article-title":"Rankings from paired comparisons","volume":"35","author":"Thompson","year":"1964","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0166-218X(94)00042-C_BIB36","series-title":"IEEE Trans. Circuit Theory","first-page":"238","article-title":"On directed graphs and integer programs","volume":"10","author":"Tucker","year":"1963"},{"key":"10.1016\/0166-218X(94)00042-C_BIB37","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCT.1967.1082662","article-title":"Generation of all Hamiltonian circuits, paths, and centers of a graph, and related problems","volume":"14","author":"Yau","year":"1967","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(94)00042-C_BIB38","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","article-title":"Minimum feedback arc sets for a directed graph","volume":"10","author":"Younger","year":"1963","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400042C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400042C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:50:50Z","timestamp":1556502650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400042C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":38,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0166218X9400042C"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00042-c","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}