{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:31:31Z","timestamp":1725514291034},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681052"},{"type":"electronic","value":"9783540681113"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68111-3_73","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:27:12Z","timestamp":1211992032000},"page":"698-707","source":"Crossref","is-referenced-by-count":2,"title":["Application of Fusion-Fission to the Multi-way Graph Partitioning Problem"],"prefix":"10.1007","author":[{"given":"Charles-Edmond","family":"Bichot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.W.: A multilevel algorithm for partitioning graphs. In: Proceedings of Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: Proceedings of Supercomputing (1995)","DOI":"10.1145\/224170.224229"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Alpert, C.J., Huang, J.H., Kahng, A.B.: Multilevel circuit partitioning. In: Proceedings of the ACM\/IEEE Design Automation Conference, pp. 530\u2013533 (1997)","DOI":"10.1145\/266021.266275"},{"issue":"1","key":"73_CR4","doi-asserted-by":"publisher","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 Journal of Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM Journal of Scientific Computing"},{"issue":"2","key":"73_CR5","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 System Technical Journal\u00a049(2), 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Diekmann, R., Monien, B., Preis, R.: Using helpful sets to improve graph bisections. In: Proceedings of the DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, pp. 57\u201373 (1995)","DOI":"10.1090\/dimacs\/021\/06"},{"issue":"1","key":"73_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing\u00a048(1), 96\u2013129 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"8","key":"73_CR9","doi-asserted-by":"publisher","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 Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., Kullis, B.: Kernel k-means, spectral clustering, and normalized cuts. In: Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (KDD), pp. 551\u2013556 (2004)","DOI":"10.1145\/1014052.1014118"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence (to appear, 2007)","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"Bichot, C.E.: A metaheuristic based on fusion and fission for partitioning problems. In: Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639518"},{"issue":"3","key":"73_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10852-007-9059-4","volume":"6","author":"C.E. Bichot","year":"2007","unstructured":"Bichot, C.E.: A new method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms. Journal of Mathematical Modeling and Algorithms (JMMA)\u00a06(3), 319\u2013344 (2007)","journal-title":"Journal of Mathematical Modeling and Algorithms (JMMA)"},{"issue":"5","key":"73_CR14","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"H.D. Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.H.: How good is recursive bisection? SIAM Journal on Scientific Computing\u00a018(5), 1436\u20131445 (1997)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"73_CR15","doi-asserted-by":"crossref","unstructured":"Ba\u00f1os, R., Gil, C., Ortega, J., Montoya, F.: Multilevel heuristic algorithm for graph partitioning. In: Proceedings of the European Workshop on Evolutionary Computation in Combinatorial Optimization, pp. 143\u2013153 (2003)","DOI":"10.1007\/3-540-36605-9_14"},{"key":"73_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"A.J. Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. Journal of Global Optimization\u00a029, 225\u2013241 (2004)","journal-title":"Journal of Global Optimization"},{"issue":"5-6","key":"73_CR17","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.parco.2003.12.016","volume":"30","author":"P. Koro\u0161ec","year":"2004","unstructured":"Koro\u0161ec, P., \u0160ilc, J., Robi\u010d, B.: Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Computing\u00a030(5-6), 785\u2013801 (2004)","journal-title":"Parallel Computing"},{"key":"73_CR18","unstructured":"Hendrickson, B., Leland, R.: The Chaco User\u2019s Guide. Sandia National Laboratories. 2.0 edn. (1995)"},{"key":"73_CR19","unstructured":"Walshaw, C.: The serial JOSTLE library user guide. University of Greenwich. 3.0 edn. (July 2002)"},{"key":"73_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing\u00a022, 63\u201380 (2000)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"73_CR21","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 edn. (September 1998)"},{"key":"73_CR22","unstructured":"Preis, R., Diekmann, R.: The Party Partitioning Library, User Guide. University of Paderborn. 1.99 edn. (October 1998)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68111-3_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:35:02Z","timestamp":1620016502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68111-3_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681052","9783540681113"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68111-3_73","relation":{},"subject":[]}}