{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:22:04Z","timestamp":1738387324634,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698388"},{"type":"electronic","value":"9783540698395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69839-5_63","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"841-851","source":"Crossref","is-referenced-by-count":2,"title":["An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection"],"prefix":"10.1007","author":[{"given":"Yong-Hyuk","family":"Kim","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Alpert, C., Kahng, A.B.: A general framework for vertex orderings, with applications to netlist clustering. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 63\u201367 (1994)","DOI":"10.1109\/ICCAD.1994.629745"},{"issue":"1-2","key":"63_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal\u00a019(1-2), 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"issue":"4","key":"63_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/12.762522","volume":"48","author":"R. Battiti","year":"1999","unstructured":"Battiti, R., Bertossi, A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers\u00a048(4), 361\u2013385 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"Bui, T.N., Heigham, C., Jones, C., Leighton, T.: Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms. In: Proceedings of the 26th ACM\/IEEE Design Automation Conference, pp. 775\u2013778 (1989)","DOI":"10.1145\/74382.74527"},{"issue":"7","key":"63_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T.N. Bui","year":"1996","unstructured":"Bui, T.N., Moon, B.-R.: Genetic algorithm and graph partitioning. IEEE Transactions on Computers\u00a045(7), 841\u2013855 (1996)","journal-title":"IEEE Transactions on Computers"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Choe, T.-Y., Park, C.-I.: A k-way graph partitioning algorithm based on clustering by eigenvector. In: Proceedings of the Fourth International Conference on Computational Science, pp. 598\u2013601 (2004)","DOI":"10.1007\/978-3-540-24687-9_81"},{"issue":"3","key":"63_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TCAD.2004.823353","volume":"23","author":"J. Cong","year":"2004","unstructured":"Cong, J., Lim, S.K.: Edge separability-based circuit clustering with application to multilevel circuit partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a023(3), 346\u2013357 (2004)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: A fast kernel-based multilevel algorithm for graph clustering. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge discovery in data mining, pp. 629\u2013634 (2005)","DOI":"10.1145\/1081870.1081948"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A linear time heuristics for improving network partitions. In: Proceedings of the 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"63_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"63_CR11","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"Huang, M.L., Nguyen, Q.V.: A fast algorithm for balanced graph clustering. In: Proceedings of the Eleventh International Conference on Information Visualization, pp. 46\u201352 (2007)","DOI":"10.1109\/IV.2007.10"},{"key":"63_CR13","doi-asserted-by":"crossref","unstructured":"Hwang, I., Kim, Y.-H., Moon, B.-R.: Multi-attractor gene reordering for graph bisection. In: Proceedings of the Eighth Annual Conference on Genetic and Evolutionary Computation, pp. 1209\u20131216 (2006)","DOI":"10.1145\/1143997.1144188"},{"key":"63_CR14","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing: An experimental evaluation, Part 1, graph partitioning. Operations Research\u00a037, 865\u2013892 (1989)","journal-title":"Operations Research"},{"key":"63_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"Bell Systems Technical Journal"},{"issue":"2","key":"63_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/B:HEUR.0000026263.43711.44","volume":"10","author":"Y.-H. Kim","year":"2004","unstructured":"Kim, Y.-H., Moon, B.-R.: Investigation of the fitness landscapes in graph bipartitioning: An empirical study. Journal of Heuristics\u00a010(2), 111\u2013133 (2004)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"63_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/B:HEUR.0000019985.94952.eb","volume":"10","author":"Y.-H. Kim","year":"2004","unstructured":"Kim, Y.-H., Moon, B.-R.: Lock-gain based graph partitioning. Journal of Heuristics\u00a010(1), 37\u201357 (2004)","journal-title":"Journal of Heuristics"},{"issue":"4598","key":"63_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"63_CR19","first-page":"299","volume":"5","author":"O.C. Martin","year":"1991","unstructured":"Martin, O.C., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Systems\u00a05(3), 299\u2013326 (1991)","journal-title":"Complex Systems"},{"issue":"1","key":"63_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation\u00a08(1), 61\u201391 (2000)","journal-title":"Evolutionary Computation"},{"issue":"4","key":"63_CR21","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1162\/evco.2007.15.4.445","volume":"15","author":"A. Moraglio","year":"2007","unstructured":"Moraglio, A., Kim, Y.-H., Yoon, Y., Moon, B.-R.: Geometric crossovers for multiway graph partitioning. Evolutionary Computation\u00a015(4), 445\u2013474 (2007)","journal-title":"Evolutionary Computation"},{"key":"63_CR22","doi-asserted-by":"crossref","unstructured":"Saha, B., Mitra, P.: Dynamic algorithm for graph clustering using minimum cut tree. In: Proceedings of the Sixth IEEE International Conference on Data Mining Workshops, pp. 667\u2013671 (2006)","DOI":"10.1109\/ICDMW.2006.65"},{"issue":"1","key":"63_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"63_CR24","doi-asserted-by":"crossref","unstructured":"Wang, J., Peng, H., Hu, J., Yang, C.: A graph clustering algorithm based on minimum and normalized cut. In: Proceedings of the Seventh International Conference on Computational Science, pp. 497\u2013504 (2007)","DOI":"10.1007\/978-3-540-72584-8_66"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69839-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:07:15Z","timestamp":1738325235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69839-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698388","9783540698395"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69839-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}