{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:57:00Z","timestamp":1648670220680},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":[[1992,4]]},"DOI":"10.1016\/0020-0190(92)90126-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"19-24","source":"Crossref","is-referenced-by-count":7,"title":["A linear time algorithm for graph partition problems"],"prefix":"10.1016","volume":"42","author":[{"given":"L.H.","family":"Clark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Shahrokhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90126-G_BIB1","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0020-0190(92)90126-G_BIB2","series-title":"Wadsworth & Brooks\/Cole Mathematics Series","article-title":"Graphs and Diagraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0020-0190(92)90126-G_BIB3","unstructured":"R.C. Entringer, Personal Communication."},{"key":"10.1016\/0020-0190(92)90126-G_BIB4","unstructured":"P. Erd\u00f6s, Personal Communication."},{"key":"10.1016\/0020-0190(92)90126-G_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90126-G_BIB6","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/0020-0190(92)90126-G_BIB7","series-title":"Progress in Graph Theory","first-page":"295","article-title":"On the minimal cut problem","author":"Goldberg","year":"1984"},{"key":"10.1016\/0020-0190(92)90126-G_BIB8","series-title":"Complexity Issues in VLSI","author":"Leighton","year":"1983"},{"key":"10.1016\/0020-0190(92)90126-G_BIB9","first-page":"62","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms","author":"Leighton","year":"1988","journal-title":"Proc. FOCS"},{"key":"10.1016\/0020-0190(92)90126-G_BIB10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(90)90133-W","article-title":"Sparsest cuts and bottlenecks in graphs","volume":"27","author":"Matula","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90126-G_BIB11","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0020-0190(92)90126-G_BIB12","first-page":"229","article-title":"Optimization, approximation, and complexity class","author":"Papadimitriou","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90126-G_BIB13","unstructured":"T. Porter, On a bottleneck bipartition conjecture of Erd\u00f6sCombinatorica, to appear."},{"key":"10.1016\/0020-0190(92)90126-G_BIB14","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","article-title":"The maximum concurrent flow problem","volume":"37","author":"Shahrokhi","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90126-G_BIB15","series-title":"Tech. Rept. N-90-002","article-title":"A linear time algorithm for graph partition problems","author":"Shahrokhi","year":"1990"},{"key":"10.1016\/0020-0190(92)90126-G_BIB16","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290126G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290126G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:05Z","timestamp":1555144025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290126G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290126G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90126-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}