{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:22:26Z","timestamp":1765545746134},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:12:20Z","timestamp":1330240340000},"page":"744-750","source":"Crossref","is-referenced-by-count":50,"title":["Between Min Cut and Graph Bisection"],"prefix":"10.1007","author":[{"given":"Dorothea","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T. N. Bui","year":"1987","unstructured":"T. N. Bui, S. Chaudhuri, F. T. Leighton, M. Sipser: Graph Bisection Algorithms With Good Average Case Behaviour, Combinatorica 7 (1987) 171\u2013191","journal-title":"Combinatorica"},{"key":"65_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"L. R. Ford, D. R. Fulkerson: Maximal Flow Through a Network, Canadian J. Math. 8 (1956) 399\u2013404","journal-title":"Canadian J. Math."},{"key":"65_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. J. Garey","year":"1976","unstructured":"M. J. Garey, D. S. Johnson, L. Stockmeyer: Some Simplified NP-complete Graph Problems, Theoretical Computer Science 1 (1976) 237\u2013267","journal-title":"Theoretical Computer Science"},{"key":"65_CR4","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg, R. E. Tarjan: A New Approach to the Maximum Flow Problem, Journal of the ACM 35 (1988) 921\u2013940","journal-title":"Journal of the ACM"},{"key":"65_CR5","unstructured":"J. Hao, J. B. Orlin: A Faster Algorithm for Finding the Minimum Cut in a Graph, Proceedings of the third ACM-SIAM Symposium on Discrete Algorithms (SODA'91) (1991) 165\u2013174"},{"key":"65_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, R. E. Tarjan: A Planar Separator Theorem, SIAM J. on Applied Math. 36 (1979) 177\u2013189","journal-title":"SIAM J. on Applied Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:59:35Z","timestamp":1619557175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}