{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:56Z","timestamp":1725490256171},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_46","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"524-536","source":"Crossref","is-referenced-by-count":8,"title":["Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[]},{"given":"Robert","family":"Preis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S096354839700299X","volume":"6","author":"N. Alon","year":"1997","unstructured":"N. Alon. On the edge-expansion of graphs. Combinatorics, Probability and Computing, 6:145\u2013152, 1997.","journal-title":"Combinatorics, Probability and Computing"},{"key":"46_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40064-8_4","volume-title":"Workshop on Graph-Theoretic Concepts in Computer Science (WG)","author":"S. L. Bezroukov","year":"2000","unstructured":"S. L. Bezroukov, R. Els\u00e4sser, B. Monien, R. Preis, and J.-P. Tillich. New spectral lower bounds on the bisection width of graphs. In Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 1928, pages 23\u201334, 2000."},{"key":"46_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0195-6698(88)80014-3","volume":"9","author":"B. Bollobas","year":"1988","unstructured":"B. Bollobas. The isoperimetric number of random regular graphs. Europ. J. Combinatorics, 9:241\u2013244, 1988.","journal-title":"Europ. J. Combinatorics"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"C. F. Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar. On the bisection width and expansion of butterfly networks. In Proc. Int. Parallel Processing Symp. (IPPS), pages 144\u2013150, 1998.","DOI":"10.1109\/IPPS.1998.669902"},{"issue":"2","key":"46_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T. N. Bui","year":"1987","unstructured":"T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sisper. Graph bisection algorithms with good average case behaviour. Combinatorica, 7(2):171\u2013191, 1987.","journal-title":"Combinatorica"},{"issue":"3","key":"46_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01285816","volume":"12","author":"P. Chiu","year":"1992","unstructured":"P. Chiu. Cubic ramanujan graphs. Combinatorica, 12(3):275\u2013285, 1992.","journal-title":"Combinatorica"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1017\/S0004972700003300","volume":"39","author":"L. H. Clark","year":"1988","unstructured":"L. H. Clark and R. C. Entringer. The bisection width of cubic graphs. Bulletin of th Australian Mathematical Society, 39:389\u2013396, 1988.","journal-title":"Bulletin of th Australian Mathematical Society"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. In Interconnection Networks and Mapping and Scheduling Parallel Computations, pages 57\u201373. AMS, 1995.","DOI":"10.1090\/dimacs\/021\/06"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In Symp. on Found. of Computer Science (FOCS), pages 105\u2013115, 2000.","DOI":"10.1109\/SFCS.2000.892070"},{"issue":"100","key":"46_CR10","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J., Praha, 25(100):619\u2013633, 1975.","journal-title":"Czechoslovak Math. J., Praha"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237\u2013267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"46_CR12","unstructured":"B. Hendrickson and R. Leland. Chaco 2.0. Technical Report 94-2692, Sandia, 1994."},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d and B. Monien. The bisection problem for graphs of degree 4. In Festschrift zum 60. Geburtstag von G\u00fcnter Hotz, pages 215\u2013234. Teubner, 1992.","DOI":"10.1007\/978-3-322-95233-2_13"},{"key":"46_CR14","unstructured":"G. Karypis and V. Kumar. METIS Manual 4.0. University of Minnesota, 1998."},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka and L. S. Melnikov. On bounds of the bisection width of cubic graphs. In Czech. Symp. on Comb., Graphs and Complexity, pages 151\u2013154, 1992.","DOI":"10.1016\/S0167-5060(08)70620-4"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka and L. S. Melnikov. On a lower bound for the isoperimetric number of cubic graphs. In Probabilistic Methods in Discrete Math., pages 251\u2013265, 1993.","DOI":"10.1515\/9783112318980-020"},{"issue":"3","key":"46_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261\u2013277, 1988.","journal-title":"Combinatorica"},{"issue":"6","key":"46_CR18","first-page":"647","volume":"J67-D","author":"Y. Manabe","year":"1994","unstructured":"Y. Manabe, K. Hagihara, and N. Tokura. The minimum bisection widths of the cube-connected cycles graph and cube graph. Transactions of the IEICE, J67-D(6):647\u2013654, 1994. (in Japanese).","journal-title":"Transactions of the IEICE"},{"issue":"1","key":"46_CR19","first-page":"39","volume":"24","author":"G. A. Margulis","year":"1988","unstructured":"G. A. Margulis. Explicit group-theoretical constructions of combinatorial schemes. Probl. Inf. Transm., 24(1):39\u201346, 1988.","journal-title":"Probl. Inf. Transm."},{"key":"46_CR20","unstructured":"B. Monien and R. Diekmann. A local graph partitioning heuristic meeting bisection bounds. In 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997."},{"issue":"12","key":"46_CR21","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/S0167-8191(00)00049-1","volume":"26","author":"B. Monien","year":"2000","unstructured":"B. Monien, R. Preis, and R. Diekmann. Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing, 26(12):1609\u20131634, 2000.","journal-title":"Parallel Computing"},{"issue":"1","key":"46_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"M. Morgenstern. Existence and explicit constructions of q + 1 regular ramanujan graphs for every prime power q. J. Comb. Theory, Ser. B, 62(1):44\u201362, 1994.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"46_CR23","unstructured":"F. Pellegrini. SCOTCH 3.1. Technical Report 1137-96, University of Bordeaux, 1996."},{"key":"46_CR24","unstructured":"R. Preis. Analyses and Design of Efficient Graph Partitioning Methods. Heinz Nixdorf Institut Verlagsschriftenreihe, 2000. Dissertation, Universit\u00e4t Paderborn."},{"key":"46_CR25","unstructured":"C. Walshaw. The Jostle user manual: Version 2.2. University of Greenwich, 2000."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T09:16:31Z","timestamp":1629623791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}