{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:56:23Z","timestamp":1780073783725,"version":"3.54.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"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":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90133-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"113-123","source":"Crossref","is-referenced-by-count":67,"title":["Sparsest cuts and bottlenecks in graphs"],"prefix":"10.1016","volume":"27","author":[{"given":"David W.","family":"Matula","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Farhad","family":"Shahrokhi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90133-W_BIB1","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","article-title":"Interprocessor traffic scheduling algorithm for multiple-processor networks","volume":"36","author":"Bianchini","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90133-W_BIB2","first-page":"629","article-title":"Two flow rerouting algorithms for the maximum concurrent flow problem","author":"Biswas","year":"1986","journal-title":"Proceedings FJCC"},{"key":"10.1016\/0166-218X(90)90133-W_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(90)90133-W_BIB4","first-page":"242","article-title":"Shortest path problems in planar graphs","author":"Frederickson","year":"1983","journal-title":"Proceedings 24th IEEE Symposium on Foundation of Computer Science"},{"key":"10.1016\/0166-218X(90)90133-W_BIB5","series-title":"Computer and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90133-W_BIB6","first-page":"1074","article-title":"A cut saturization algorithm for topological design of packet switched communication networks","author":"Gerla","year":"1974","journal-title":"Proceedings NTC"},{"key":"10.1016\/0166-218X(90)90133-W_BIB7","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"key":"10.1016\/0166-218X(90)90133-W_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/0214023","article-title":"An efficient algorithm for finding multicommodity flows in planar networks","volume":"14","author":"Matsumoto","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90133-W_BIB9","series-title":"Numerical Taxonomy","first-page":"156","article-title":"Cluster validity by concurrent chaining","author":"Matula","year":"1983"},{"key":"10.1016\/0166-218X(90)90133-W_BIB10","series-title":"Graph Theory and its Applications to Algorithms and Computer Science","first-page":"543","article-title":"Concurrent flow and concurrent connectivity in graphs","author":"Matula","year":"1985"},{"key":"10.1016\/0166-218X(90)90133-W_BIB11","series-title":"Classification as a Tool of Research","first-page":"289","article-title":"Divisive vs agglomerative average linkage hierarchical clustering","author":"Matula","year":"1986"},{"key":"10.1016\/0166-218X(90)90133-W_BIB12","first-page":"205","article-title":"On solving large maximum concurrent flow problems","author":"Shahrokhi","year":"1987","journal-title":"Proceedings ACM Computer Conference"},{"key":"10.1016\/0166-218X(90)90133-W_BIB13","doi-asserted-by":"crossref","unstructured":"F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J. ACM (to appear).","DOI":"10.1145\/77600.77620"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090133W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090133W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:53Z","timestamp":1555120613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090133W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090133W"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90133-w","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}