{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:47:44Z","timestamp":1765993664845},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0196-6774(89)90024-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"76-85","source":"Crossref","is-referenced-by-count":10,"title":["Finding the edge connectivity of directed graphs"],"prefix":"10.1016","volume":"10","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90024-2_BIB1","unstructured":"N. Alon, Personal communication."},{"key":"10.1016\/0196-6774(89)90024-2_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0196-6774(89)90024-2_BIB3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230140211","article-title":"On computing the connectivities of graphs and digraphs","author":"Esfahanian","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0196-6774(89)90024-2_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0196-6774(89)90024-2_BIB5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(89)90024-2_BIB6","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(89)90024-2_BIB7","series-title":"Proceedings, 28th Symp. on Foundations of Computer Science","first-page":"249","article-title":"Determining edge connectivity in O(nm)","author":"Matula","year":"1987"},{"key":"10.1016\/0196-6774(89)90024-2_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/0208019","article-title":"Bottlenecks and edge connectivity in unsymmetrical networks","author":"Scnorr","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:54:51Z","timestamp":1548726891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0196677489900242"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90024-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}