{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T01:27:47Z","timestamp":1773538067745,"version":"3.50.1"},"reference-count":16,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1002\/1098-2418(200101)18:1<31::aid-rsa3>3.0.co;2-1","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T11:24:52Z","timestamp":1100431492000},"page":"31-38","source":"Crossref","is-referenced-by-count":10,"title":["Bisecting sparse random graphs"],"prefix":"10.1002","volume":"18","author":[{"given":"Malwina J.","family":"Luczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"McDiarmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(89)90316-6","volume":"76","author":"Aldous","year":"1989","journal-title":"Discrete Math"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB2","volume-title":"The probabilistic method","author":"Alon","year":"1992","unstructured":"and The probabilistic method, Wiley, New York, 1992."},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB3","volume-title":"Random graphs","author":"Bollob\u00e1s","year":"1985","unstructured":"Random graphs, Academic Press, New York, 1985."},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB4","author":"Barraez","journal-title":"Combin Probab Comput"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"Biu","year":"1987","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB6","first-page":"17","volume":"5","author":"Erd?s","year":"1960","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02523688","volume":"18","author":"Frieze","year":"1997","journal-title":"Algorithmica"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret Comput Sci"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1137\/0403007","volume":"3","author":"Goldschmidt","year":"1980","journal-title":"SIAM J Discrete Math"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB10","author":"Goldberg","unstructured":"and On the minimal cut problem, Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, 1982."},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB11","first-page":"19","volume":"49","author":"Goldberg","year":"1985","journal-title":"Congr Numer"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB12","author":"Luczak","journal-title":"Discrete Appl Math"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB13","volume-title":"Concentration, in probabilistic methods for algorithmic discrete mathematics","author":"McDiarmid","year":"1998","unstructured":"Concentration, in probabilistic methods for algorithmic discrete mathematics, and (Editors), Springer-Verlag, Berlin, 1998."},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB14","author":"MacGregor","unstructured":"On partitioning a graph: a theoretical and empirical study, Ph.D. thesis, Stanford University, 1978."},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s004400050149","volume":"110","author":"O'Connell","year":"1998","journal-title":"Probab Theory Related Fields"},{"key":"10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1-BIB16","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/81.250179","volume":"39","author":"Rao","year":"1992","journal-title":"IEEE Trans Circuits Systems-1 Fund Theory Appl"}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200101)18:1%3C31::AID-RSA3%3E3.0.CO;2-1","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200101)18:1%3C31::AID-RSA3%3E3.0.CO;2-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T02:17:03Z","timestamp":1625105823000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200101)18:1<31::aid-rsa3>3.0.co;2-1","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}