{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:27:42Z","timestamp":1757615262095,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,10]],"date-time":"1999-02-10T00:00:00Z","timestamp":918604800000},"content-version":"vor","delay-in-days":1167,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0012-365x(94)00233-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"151-169","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Generalizing the all-pairs min cut problem"],"prefix":"10.1016","volume":"147","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00233-9_BIB1","series-title":"Advanced Techniques in the Practice of Operations Research","first-page":"333","article-title":"Matroids and operations research","author":"Bixby","year":"1982"},{"article-title":"Matrices Totalement Unimodulaires et Probl\u00e8mes Combinatoires","year":"1963","author":"Camion","key":"10.1016\/0012-365X(94)00233-9_BIB2"},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/0012-365X(94)00233-9_BIB3"},{"key":"10.1016\/0012-365X(94)00233-9_BIB4","series-title":"Mathematics of the Decision Sciences","first-page":"303","article-title":"Networks, frames, blocking systems","volume":"Vol. 11","author":"Fulkerson","year":"1968"},{"key":"10.1016\/0012-365X(94)00233-9_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02063301","article-title":"\u00dcber regul\u00e4re Kettengruppen","volume":"10","author":"Gallai","year":"1959","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(94)00233-9_BIB6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(94)00233-9_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(86)90079-X","article-title":"Multi-terminal maximum flows in node-capacitated networks","volume":"13","author":"Granot","year":"1986","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/0012-365X(94)00233-9_BIB8","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1287\/moor.13.4.535","article-title":"Solution bases of multiterminal cut problems","volume":"13","author":"Hassin","year":"1988","journal-title":"Math. Oper. Res."},{"year":"1969","series-title":"Integer Programming and Network Flows","author":"Hu","key":"10.1016\/0012-365X(94)00233-9_BIB9"},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/0012-365X(94)00233-9_BIB10"},{"key":"10.1016\/0012-365X(94)00233-9_BIB11","first-page":"485","article-title":"On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming","volume":"15","author":"Minty","year":"1966","journal-title":"J. Math. Mech."},{"key":"10.1016\/0012-365X(94)00233-9_BIB12","series-title":"Combinatorial Math. and its Applications","first-page":"104","article-title":"The elementary vectors of a subspace of RN","author":"Rockafellar","year":"1969"},{"key":"10.1016\/0012-365X(94)00233-9_BIB13","first-page":"189","article-title":"The matroids with the max-flow min-cut property","volume":"23","author":"Seymour","year":"1977","journal-title":"JCT (B)"},{"key":"10.1016\/0012-365X(94)00233-9_BIB14","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/S0167-5060(08)70757-X","article-title":"On the generality of multi-terminal flow theory","volume":"1","author":"Trotter","year":"1977","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/0012-365X(94)00233-9_BIB15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/moor.12.1.72","article-title":"Max-flow min-cut matroids: polynomial testing and polynomial algorithms for maximum flow and shortest routes","volume":"12","author":"Truemper","year":"1987","journal-title":"Math. Oper. Res."},{"year":"1992","series-title":"Matroid Decomposition","author":"Truemper","key":"10.1016\/0012-365X(94)00233-9_BIB16"},{"key":"10.1016\/0012-365X(94)00233-9_BIB17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0166-218X(86)90052-1","article-title":"A decomposition of the matroids with the max-flow min-cut property","volume":"15","author":"Tseng","year":"1986","journal-title":"Discrete Appl. Math."},{"year":"1976","series-title":"Matroid Theory","author":"Welsh","key":"10.1016\/0012-365X(94)00233-9_BIB18"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94002339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94002339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:34:24Z","timestamp":1757079264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94002339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0012365X94002339"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00233-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1995,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalizing the all-pairs min cut problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(94)00233-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}