{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:17:27Z","timestamp":1648531047219},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"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":[[2004,2]]},"DOI":"10.1016\/s0166-218x(03)00449-9","type":"journal-article","created":{"date-parts":[[2003,10,29]],"date-time":"2003-10-29T16:33:38Z","timestamp":1067445218000},"page":"341-348","source":"Crossref","is-referenced-by-count":3,"title":["Solving problems for maximal reducible flowgraphs"],"prefix":"10.1016","volume":"136","author":[{"given":"O","family":"Vernet","sequence":"first","affiliation":[]},{"given":"L","family":"Markenzon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00449-9_BIB1","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB2","doi-asserted-by":"crossref","unstructured":"M.D. Carrol, B.G. Ryder, Incremental data flow analysis via dominator and attribute updates, Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1988, pp. 274\u2013284.","DOI":"10.1145\/73560.73584"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB3","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flow graph reducibility","volume":"2","author":"Hecht","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","article-title":"Characterizations of reducible flow graphs","volume":"21","author":"Hecht","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB6","unstructured":"D.E. Knuth, The Art of Computer Programming, Fundamental Algorithms, Vol. I, Addison-Wesley, Reading, MA, 1968."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB7","unstructured":"L. Markenzon, O. Vernet, Some methods for the generation of reducible flow digraphs, Journ\u00e9es de l'Optimisation, Montr\u00e9al, Canada, (1991)."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB8","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":"9","author":"Ramachandran","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB9","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0403048","article-title":"A minimax arc theorem for reducible flow graphs","volume":"3","author":"Ramachandran","year":"1990","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB10","doi-asserted-by":"crossref","unstructured":"G. Ramalingam, T. Reps, An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, Conference Record of the 21st ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1994, pp. 287\u2013296.","DOI":"10.1145\/174675.177905"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0208051","article-title":"A linear time algorithm for finding minimum cutsets in reducible flowgraphs","volume":"8","author":"Shamir","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB12","unstructured":"V.C. Sreedhar, Efficient program analysis using DJ-Graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montr\u00e9al, Canada, 1995."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB13","doi-asserted-by":"crossref","unstructured":"V.C. Sreedhar, Y-F. Lee, G.R. Gao, Incremental computation of dominator trees, Proceedings of the ACM SIGPLAN Workshop on Intermediate Representations, 1995, pp. 1\u201312.","DOI":"10.1145\/202529.202531"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/net.3230150106","article-title":"On digraphs with a rooted tree structure","volume":"15","author":"Szwarcfiter","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB15","unstructured":"O. Vernet, Maximalidade em grafos de fluxo redut\u0131\u0301veis, D.Sc. Thesis, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil, 1997."},{"key":"10.1016\/S0166-218X(03)00449-9_BIB16","doi-asserted-by":"crossref","unstructured":"O. Vernet, L. Markenzon, Hamiltonian problems for reducible flowgraphs, Proceedings of the XVII International Conference of the Chilean Computer Science Society, Valpara\u0131\u0301so, Chile, 1997, pp. 264\u2013267.","DOI":"10.1109\/SCCC.1997.637099"},{"key":"10.1016\/S0166-218X(03)00449-9_BIB17","first-page":"9","article-title":"Characterizations and properties of maximal reducible flowgraphs","volume":"139","author":"Vernet","year":"1999","journal-title":"Congr. Numer."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004499?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004499?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:55:16Z","timestamp":1550480116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03004499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0166218X03004499"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00449-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}