{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:41:58Z","timestamp":1740145318792,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T00:00:00Z","timestamp":1535500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Pontificia Universidade Catolica do Rio de Janeiro"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10100-018-0579-y","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T22:15:46Z","timestamp":1535580946000},"page":"229-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parametric analysis on cut-trees and its application on a protein clustering problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Jo\u00e3o Paulo","family":"de Freitas Araujo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madiagne","family":"Diallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernanda Maria","family":"Pereira Raupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Berthom\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Eugenio","family":"Leal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"issue":"3","key":"579_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TCS.1976.1084194","volume":"23","author":"K Agarwal","year":"1976","unstructured":"Agarwal K, Arora SR (1976) Synthesis of multi-terminal communication nets: finding one or all solutions. IEEE Trans Circuits Syst 23(3):141\u2013146","journal-title":"IEEE Trans Circuits Syst"},{"key":"579_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.disopt.2006.05.003","volume":"3","author":"D Barth","year":"2006","unstructured":"Barth D, Berthom\u00e9 P, Diallo M, Ferreira A (2006) Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations. Discret Optim 3:195\u2013205","journal-title":"Discret Optim"},{"key":"579_CR3","unstructured":"Bhalgat A, Hariharan R, Kavitha T, Panigrahi D (2007) An \u00d5(mn) Gomory\u2013Hu tree construction algorithm for unweighted graphs. In: STOC\u201907, pp 605\u2013614"},{"key":"579_CR4","unstructured":"Diallo M (2011) M\u00e9thodes d\u2019Optimisation Appliqu\u00e9es aux R\u00e9seaux de Flots et T\u00e9l\u00e9coms. Editions universitaires europeennes"},{"issue":"5","key":"579_CR5","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.12.5.680","volume":"12","author":"SE Elmaghraby","year":"1964","unstructured":"Elmaghraby SE (1964) Sensitivity analysis of multi-terminal flow networks. Oper Res 12(5):680\u2013688","journal-title":"Oper Res"},{"key":"579_CR6","volume-title":"Flows in networks","author":"LR Ford","year":"1973","unstructured":"Ford LR, Fulkerson DR (1973) Flows in networks. Princeton University Press, Princeton"},{"key":"579_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.2000.1136","volume":"38","author":"AV Goldberg","year":"2001","unstructured":"Goldberg AV, Tsioutsiouliklis K (2001) Cut-tree algorithms: an experimental study. J Algorithms 38:51\u201383","journal-title":"J Algorithms"},{"issue":"4","key":"579_CR8","first-page":"551","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. SIAM J Comput 9(4):551\u2013570","journal-title":"SIAM J Comput"},{"key":"579_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D Gusfield","year":"1990","unstructured":"Gusfield D (1990) Very simple methods for all pairs network flow analysis. SIAM J Comput 19:143\u2013155","journal-title":"SIAM J Comput"},{"key":"579_CR10","unstructured":"Hartmann T, Wagner D (2013) Dynamic Gomory\u2013Hu tree construction\u2014fast and simple. CoRR volume \narXiv:1310.0178"},{"key":"579_CR11","volume-title":"Combinatorial algorithms, enlarged","author":"TC Hu","year":"2002","unstructured":"Hu TC, Shing MT (2002) Combinatorial algorithms, enlarged, 2nd edn. Dover Publications, Inc., Mineola","edition":"2"},{"issue":"12","key":"579_CR12","first-page":"2421","volume":"6","author":"X Liu","year":"2011","unstructured":"Liu X, Lin H, Tian Y (2011) Segmenting webpage with Gomory\u2013Hu tree based clustering. J Softw 6(12):2421\u20132425","journal-title":"J Softw"},{"key":"579_CR13","first-page":"215","volume":"14","author":"A Mitrofanova","year":"2009","unstructured":"Mitrofanova A, Farach-Colton M, Mishra B (2009) Efficient and robust prediction algorithms for protein complexes using Gomory\u2013Hu trees. Pac Symp Biocomput 14:215\u2013226","journal-title":"Pac Symp Biocomput"},{"issue":"1","key":"579_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10479-006-0155-z","volume":"150","author":"M Scutell\u00e0","year":"2007","unstructured":"Scutell\u00e0 M (2007) A note on the parametric maximum flow problem and some related reoptimization issues. Ann Oper Res 150(1):231\u2013244","journal-title":"Ann Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0579-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0579-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0579-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:20:51Z","timestamp":1578547251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0579-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,29]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["579"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0579-y","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,8,29]]},"assertion":[{"value":"29 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}