{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:40:12Z","timestamp":1787323212101,"version":"build-2736575974"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[1990,11]]},"abstract":"<jats:p>A conjecture of Frank and Gyarfas is established by proving that the cardinality of a minimum feedback arc set in a reducible flow graph is equal to the cardinality of a maximum collection of arc disjoint cycles.<\/jats:p>","DOI":"10.1137\/0403048","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T08:02:55Z","timestamp":1109145775000},"page":"554-560","source":"Crossref","is-referenced-by-count":13,"title":["A Minimax Arc Theorem for Reducible Flow Graphs"],"prefix":"10.1137","volume":"3","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,8]]},"reference":[{"key":"RAHU1","volume-title":"Principles of Compiler Design","author":"Aho A. V.","year":"1977"},{"key":"REV","volume-title":"Graph algorithms","author":"Even Shimon","year":"1979"},{"key":"RFOFU","volume-title":"Flows in networks","author":"Ford, Jr. L. R.","year":"1962"},{"key":"RFRGA","unstructured":"A. Frank, A. Gyarfas, Directed graphs and computer programs, Problemes Combinatoires et Theorie des Graphes, Vol. 260, Colloque Internationaux C.N.R.S., 1976, 157\u20131580412.05049"},{"key":"RHEU1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321835"},{"key":"RLO","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90049-6"},{"key":"RLU","unstructured":"C. L. Lucchesi, Ph.D. Thesis, A minimax equality for directed graphs, University of Waterloo, Waterloo, Ontario, Canada, 1976"},{"key":"RLUYO","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-17.3.369"},{"key":"RPAST","volume-title":"Combinatorial optimization: algorithms and complexity","author":"Papadimitriou Christos H.","year":"1982"},{"key":"RRA","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90022-3"},{"key":"RTA","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0403048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:48:22Z","timestamp":1787320102000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0403048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["10.1137\/0403048"],"URL":"https:\/\/doi.org\/10.1137\/0403048","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}