{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:45Z","timestamp":1720640865649},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0653(05)80094-0","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T19:09:41Z","timestamp":1115406581000},"page":"111-114","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Solving Problems for Maximal Reducible Flowgraphs"],"prefix":"10.1016","volume":"8","author":[{"given":"O.","family":"Vernet","sequence":"first","affiliation":[]},{"given":"L.","family":"Markenzon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80094-0_BIB1","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S1571-0653(05)80094-0_BIB2","series-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"n. 3","key":"10.1016\/S1571-0653(05)80094-0_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","article-title":"Characterizations of Reducible Flow Graphs","volume":"vol 21","author":"Hecht","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0653(05)80094-0_BIB4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0196-6774(88)90022-3","article-title":"Finding a Minimum Feedback Arc Set in Reducible Flow Graphs","volume":"vol 9","author":"Ramachandran","year":"1988","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0653(05)80094-0_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/174675.177905","article-title":"An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph","author":"Ramalingam","year":"1994","journal-title":"Conf. Rec. of the 21st ACM SIGACT-SIGPLAN Symp. on Princ. of Prog. Lang."},{"key":"10.1016\/S1571-0653(05)80094-0_BIB6","series-title":"Efficient Program Analysis Using DJ-Graphs, Ph.D. Thesis, School of Computer Science","author":"Sreedhar","year":"1995"},{"key":"10.1016\/S1571-0653(05)80094-0_BIB7","series-title":"Proc. of the XVII Intern. Conf. of the Chilean Comp. Sc. Society","first-page":"264","article-title":"Hamiltonian Problems for Reducible Flowgraphs","author":"Vernet","year":"1997"},{"key":"10.1016\/S1571-0653(05)80094-0_BIB8","first-page":"9","article-title":"Characterizations and Properties of Maximal Reducible Flowgraphs","volume":"vol 139","author":"Vernet","year":"1999","journal-title":"Congressus Numerantium"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800940?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800940?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T12:24:52Z","timestamp":1548505492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":8,"alternative-id":["S1571065305800940"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80094-0","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}