{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:05:20Z","timestamp":1725807920249},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,3,16]],"date-time":"2007-03-16T00:00:00Z","timestamp":1174003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2007,8,2]]},"DOI":"10.1007\/s10852-007-9059-4","type":"journal-article","created":{"date-parts":[[2007,3,15]],"date-time":"2007-03-15T14:17:42Z","timestamp":1173968262000},"page":"319-344","source":"Crossref","is-referenced-by-count":12,"title":["A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms"],"prefix":"10.1007","volume":"6","author":[{"given":"Charles-Edmond","family":"Bichot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,16]]},"reference":[{"key":"9059_CR1","doi-asserted-by":"crossref","unstructured":"Alpert, C.J., Huang, J.-H., Kahng, A.B.: Multilevel circuit partitioning. In: DAC, pp. 530\u2013533 (1997)","DOI":"10.1145\/266021.266275"},{"key":"9059_CR2","unstructured":"Bichot, C.-E., Alliot, J.-M. : A theoretical approach to defining the European Core Area. Technical report, LOG\u2013ENAC\/CENA (2005)"},{"key":"9059_CR3","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kullis, B.: Kernel k-means, spectral clustering, and normalized cuts. In: ACM International Conference on Knowledge Discovery and Data Mining (2004)","DOI":"10.1145\/1014052.1014118"},{"key":"9059_CR4","volume-title":"Using Helpful Sets to Improve Graph Bisections","author":"R. Diekmann","year":"1995","unstructured":"Diekmann, R., Monien, B., Preis, R.: Using Helpful Sets to Improve Graph Bisections. American Mathematical Society, Providence, RI (1995)"},{"key":"9059_CR5","unstructured":"Eurocontrol: The impact of fragmentation in European ATM\/CNS. Technical report, Eurocontrol (2006)"},{"key":"9059_CR6","unstructured":"FAA: Air Traffic ControL: FAA Order 7110.65K. Federal Aviation Administration (U.S. Department of Transportation) (1997)"},{"key":"9059_CR7","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: ACM Design Automation Conference, pp.\u00a0175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"3","key":"9059_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comp. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comp. Sci."},{"issue":"1\u20132","key":"9059_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1142\/S0218213001000490","volume":"10","author":"W.A. Greene","year":"2001","unstructured":"Greene, W.A.: Genetic algorithms for partitioning sets. Int. J. Artif. Intell. Tools 10(1\u20132), 225\u2013241 (2001)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"9059_CR10","unstructured":"Hallgren, A.: Restructuring European airspace: functional airspace blocks. Skyway, 20\u201322 (2005)"},{"key":"9059_CR11","unstructured":"Hendrickson, B., Leland, R.: The chaco users guide. Sandia National Laboratories, 2.0 edition (1995a)"},{"key":"9059_CR12","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: ACM\/IEEE Conference on Supercomputing (1995b)","DOI":"10.1145\/224170.224228"},{"issue":"6","key":"9059_CR13","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning. Oper. Res. (Society of America) 37(6), 865\u2013892 (1989)","journal-title":"Oper. Res. (Society of America)"},{"issue":"1","key":"9059_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998a)","journal-title":"SIAM J. Sci. Comput."},{"key":"9059_CR15","unstructured":"Karypis, G., Kumar, V.: METIS : a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. University of Minnesota, 4.0 edition (1998b)"},{"issue":"2","key":"9059_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"4598","key":"9059_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9059_CR18","unstructured":"Kuntz, P., Layzell, P., Snyers, D.: A colony of ant-like agents for partitioning in VLSI technology. In: The Fourth European Conference on Artificial Life, pp. 417\u2013424 (1997)"},{"key":"9059_CR19","unstructured":"Langham, A.E., Grant, P.W.: A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies. In: The Genetic and Evolutionary Computation Conf., vol. 2., pp. 1602\u20131608. Orlando, FL (1999a)"},{"key":"9059_CR20","unstructured":"Langham, A.E., Grant, P.W.: A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies. In: ACM GECCO (1999b)"},{"key":"9059_CR21","unstructured":"Pellegrini, F.: Schotch and LibScotch. ENSEIRB\u2013LaBRI, Universit de Bordeaux I, 4.0 edition (2006)"},{"issue":"8","key":"9059_CR22","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9059_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"A. Soper","year":"2004","unstructured":"Soper, A., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Glob. Optim. 29, 225\u2013241 (2004)","journal-title":"J. Glob. Optim."},{"key":"9059_CR24","volume-title":"Proceedings of the ACM International Conference on Supercomputing","author":"E.G. Talbi","year":"1991","unstructured":"Talbi, E.G., Bessiere, P.: A parallel genetic algorithm for the graph partitioning problem. In: Proceedings of the ACM International Conference on Supercomputing. ACM, Cologne (1991)"},{"key":"9059_CR25","unstructured":"Walshaw, C.: The serial JOSTLE library user guide. University of Greenwich, 3.0 edition (2002)"},{"key":"9059_CR26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Ann. Oper. Res. 131, 325\u2013372 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9059_CR27","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0307-904X(00)00041-X","volume":"25","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M., McManus, K.: Multiphase mesh partitioning. Appl. Math. Model. 25, 123\u2013140 (2000)","journal-title":"Appl. Math. Model."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9059-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-007-9059-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9059-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-007-9059-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,16]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,8,2]]}},"alternative-id":["9059"],"URL":"https:\/\/doi.org\/10.1007\/s10852-007-9059-4","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,16]]}}}