{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:33Z","timestamp":1725564753255},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_7","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"71-80","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Parametric Multi-terminal Flows Problem"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Berthom\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madiagne","family":"Diallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afonso","family":"Ferreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Berge, C.: Graphs and Hypergraphs, North Holland, Amsterdam (1973)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Berthom\u00e9, P., Diallo, M., Ferreira, A.: Generalized parametric multi-terminal flow problem. Technical Report LRI-1355, LRI (March 2003), available at http:\/\/www.lri.fr\/~berthome\/","DOI":"10.1007\/978-3-540-39890-5_7"},{"key":"7_CR3","unstructured":"Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: ACM Symposium On Discrete Algorithms, New Orleans, Louisiana, January 5-7, pp. 324\u2013333 (1997)"},{"key":"7_CR4","unstructured":"Cohen, J., Duarte Jr, E.P.: Fault-tolerant routing of TCP\/IP PDU\u2019s on general topology backbones. Design of Reliable Communication Networks, Budapest, Hungary (October 2001)"},{"key":"7_CR5","unstructured":"Diallo, M.: Parametric multi-terminal networks flow analysis. Master\u2019s thesis, Dpt of Mathematics, University of Kaiserslautern, Germany (October 2000)"},{"key":"7_CR6","unstructured":"Diallo, M., Hamacher, H.W.: Parametric capacity and multi-terminal network flows. Technical Report 60, AG-Hamacher, University of Kaiserslautern, Germany (2002)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Elmaghraby, S.E.: On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks. Journal of Franklin Institute (October 1964)","DOI":"10.1016\/0016-0032(64)90328-X"},{"key":"7_CR8","first-page":"680","volume":"12","author":"S.E. Elmaghraby","year":"1964","unstructured":"Elmaghraby, S.E.: Sensitivity analysis of multi-terminal network flows. J. ORSA\u00a012, 680\u2013688 (1964)","journal-title":"J. ORSA"},{"key":"7_CR9","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1973","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1973)"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM Journal of Computing\u00a019, 143\u2013155 (1990)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR12","volume-title":"Combinatorial Algorithms.","author":"T.C. Hu","year":"1982","unstructured":"Hu, T.C.: Combinatorial Algorithms. Addison-Wesley Publ. Comp, Reading (1982)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:19:07Z","timestamp":1559567947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}