{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:04:13Z","timestamp":1768737853524,"version":"3.49.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00079-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"41-44","source":"Crossref","is-referenced-by-count":23,"title":["On the number of small cuts in a graph"],"prefix":"10.1016","volume":"59","author":[{"given":"Monika","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00079-8_BIB1","series-title":"Proc. 28th Ann. Symp. on the Theory of Computing","article-title":"Minimum cuts in near-linear time","author":"Karger","year":"1996"},{"key":"10.1016\/0020-0190(96)00079-8_BIB2","series-title":"Proc. 25th Ann. Symp. on the Theory of Computing","first-page":"757","article-title":"A new approach to the minimum cut problem","author":"Karger","year":"1993"},{"key":"10.1016\/0020-0190(96)00079-8_BIB3","series-title":"Proc. 5th Internat. Symposium on Algorithms and Computation","first-page":"190","article-title":"Computing all small cuts in an undirected network","volume":"834","author":"Nagamochi","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000798?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000798?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:04Z","timestamp":1556058244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000798"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00079-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}