{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:29Z","timestamp":1759063589483},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-6377(97)00043-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"225-227","source":"Crossref","is-referenced-by-count":26,"title":["A new and improved algorithm for the 3-cut problem"],"prefix":"10.1016","volume":"21","author":[{"given":"Michel","family":"Burlet","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Goldschmidt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6377(97)00043-6_BIB1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.19.1.24","article-title":"A polynomial time algorithm for thek-cut Problem fork fixed","volume":"19","author":"Goldschmidt","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00043-6_BIB2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","article-title":"Computing edge connectivity in multigraphs and capacitated graphs","volume":"5","author":"Nagamochi","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0167-6377(97)00043-6_BIB3","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, K. Nishimura, T. Ibaraki, Computing all small cuts in undirected networks, in: Ding-Zhu Du, Xiang-Sun Zhang (Eds.), Lectures Notes in Computer Science, vol. 834, Springer, Berlin, Algorithms and Computation, ISAAC\u201994, 1994, pp. 190\u2013198.","DOI":"10.1007\/3-540-58325-4_181"},{"key":"10.1016\/S0167-6377(97)00043-6_BIB4","unstructured":"C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"10.1016\/S0167-6377(97)00043-6_BIB5","unstructured":"Pulleyblank, Presentation at SIAM Meeting on Optimization, MIT, Boston, 1982."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:18Z","timestamp":1555563258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0167637797000436"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00043-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}