{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:40:43Z","timestamp":1649043643296},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":3735,"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":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00501-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"387-394","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing the flow equivalent trees of a network"],"prefix":"10.1016","volume":"128","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00501-2_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB2","series-title":"Proofs from The Book","author":"Aigner","year":"1999"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","article-title":"The minimum number of edges and vertices in a graph with edge connectivity n and mn-bonds","volume":"5","author":"Bixby","year":"1975","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB4","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB5","unstructured":"E.A. Dinits, A.V. Karzanov, M.V. Lomonosov, On the structure of a family of minimal weighted cuts in a graph, in: A.A. Fridman (Ed.), Studies in Discrete Optimization, Nauka, Moscow, 1976, pp. 290\u2013306. (Original article in Russian. Translation available from NTC-National Translations Center, Library of Congress, Cataloging Distribution Service, Washington DC 20541, USA (NTC 89-20265))."},{"issue":"1","key":"10.1016\/S0166-218X(02)00501-2_BIB6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/jagm.1999.1039","article-title":"Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time","volume":"33","author":"Fleischer","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB7","first-page":"551","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"J. SIAM"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB8","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0166-218X(02)00501-2_BIB9","series-title":"Combinatorial Algorithms","author":"Hu","year":"1982"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BF01074775","article-title":"Efficient algorithms for finding all minimal edge cuts of a nonoriented graph","volume":"22","author":"Karzanov","year":"1986","journal-title":"Cybernetics"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF03167227","article-title":"Canonical cactus representation for all minimum cuts","volume":"11","author":"Nagamochi","year":"1994","journal-title":"Japan J. Ind. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00501-2_BIB12","series-title":"Matroid Theory","author":"Oxley","year":"1992"},{"key":"10.1016\/S0166-218X(02)00501-2_BIB13","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","article-title":"On the decomposition of Kn into complete bipartite graphs","volume":"6","author":"Tverberg","year":"1982","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:58:05Z","timestamp":1553407085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02005012"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00501-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}