{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:26:04Z","timestamp":1764570364246,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741954"},{"type":"electronic","value":"9783540741985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74198-5_1","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T03:34:48Z","timestamp":1186976088000},"page":"1-12","source":"Crossref","is-referenced-by-count":10,"title":["An Effective Multi-level Algorithm Based on Simulated Annealing for Bisecting Graph"],"prefix":"10.1007","author":[{"given":"Lingyu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Leng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","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. Integration, the VLSI Journal\u00a019, 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Hsu, W.H., Anvil, L.S.: Self-organizing systems for knowledge discovery in large databases. In: International Joint Conference on Neural Networks, pp. 2480\u20132485 (1999)","DOI":"10.1109\/IJCNN.1999.833461"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: Proc. ACM Conf. Information and Knowledge Management, pp. 25\u201332 (2001)","DOI":"10.2172\/816202"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A Min-Max cut algorithm for graph partitioning and data clustering. In: Proc. IEEE Conf. Data Mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"1_CR5","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731\u2013737 (1997)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 888\u2013905 (2000)","DOI":"10.1109\/34.868688"},{"key":"1_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. WH Freeman, New York (1979)"},{"key":"1_CR8","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, 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A linear-time heuristics for improving network partitions. In: Proc. 19th Design Automation Conf. pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Leng, M., Yu, S., Chen, Y.: An effective refinement algorithm based on multi-level paradigm for graph bipartitioning. In: The IFIP TC5 International Conference on Knowledge Enterprise. IFIP Series, pp. 294\u2013303. Springer (2006)","DOI":"10.1007\/0-387-34403-9_41"},{"key":"1_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11811305_54","volume-title":"Advanced Data Mining and Applications","author":"M. Leng","year":"2006","unstructured":"Leng, M., Yu, S.: An effective multi-level algorithm for bisecting graph. In: Li, X., Za\u00efane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol.\u00a04093, pp. 493\u2013500. Springer, Heidelberg (2006)"},{"key":"1_CR12","unstructured":"\u017bola, J., Wyrzykowski, R.: Application of genetic algorithm for mesh partitioning. In: Proc. Workshop on Parallel Numerics, pp. 209\u2013217 (2000)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Bahreininejad, A., Topping, B.H.V., Khan, A.I.: Finite element mesh partitioning using neural networks. Advances in Engineering Software, 103\u2013115 (1996)","DOI":"10.1016\/0965-9978(96)00011-7"},{"key":"1_CR14","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-71701-0_16","volume-title":"The 11th PacificAsia Conference on Knowledge Discovery and Data Mining","author":"M. Leng","year":"2007","unstructured":"Leng, M., Yu, S.: An effective multi-level algorithm based on ant colony optimization for bisecting graph. In: The 11th PacificAsia Conference on Knowledge Discovery and Data Mining. LNCS(LNAI), pp. 138\u2013149. Springer, Heidelberg (2007)"},{"key":"1_CR15","series-title":"LNCS(LNAI)","volume-title":"The 3rd International Conference on Advanced Data Mining and Applications","author":"L. Sun","year":"2007","unstructured":"Sun, L., Leng, M., Yu, S.: A new multi-level algorithm based on particle swarm optimization for bisecting graph. In: The 3rd International Conference on Advanced Data Mining and Applications. LNCS(LNAI), Springer, Heidelberg (2007)"},{"key":"1_CR16","series-title":"LNCS(LNAI)","volume-title":"The International symposium on combinatorics, algorithms, probabilistic and experimental methodologies","author":"L. Sun","year":"2007","unstructured":"Sun, L., Leng, M.: An effective refinement algorithm based on swarm intelligence for graph bipartitioning. In: The International symposium on combinatorics, algorithms, probabilistic and experimental methodologies. LNCS(LNAI), Springer, Heidelberg (2007)"},{"key":"1_CR17","unstructured":"Karypis, G., Kumar, V.: MeTiS 4.0: Unstructured graphs partitioning and sparse matrix ordering system. Technical Report, Department of Computer Science, University of Minnesota (1998)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TCAD.2005.854637","volume":"25","author":"N. Selvakkumaran","year":"2006","unstructured":"Selvakkumaran, N., Karypis, G.: Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization. IEEE Trans. Computer Aided Design\u00a025, 504\u2013517 (2006)","journal-title":"IEEE Trans. Computer Aided Design"},{"key":"1_CR19","unstructured":"Amine, A.B., Karypis, G.: Multi-level algorithms for partitioning power-law Graphs. Technical Report, Department of Computer Science, University of Minnesota (2005), available on the WWW at URL http:\/\/www.cs.umn.edu\/~metis"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Gil, C., Ortega, J., Montoya, M.G.: Parallel heuristic search in multilevel graph partitioning. In: Proc. 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 88\u201395 (2004)","DOI":"10.1109\/EMPDP.2004.1271432"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Alpert, C.J.: The ISPD98 circuit benchmark suite. In: Proc. Intel Symposium of Physical Design, pp. 80\u201385 (1998)","DOI":"10.1145\/274535.274546"},{"key":"1_CR22","volume-title":"Simulated annealing and boltzmann machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E. Aarts","year":"1990","unstructured":"Aarts, E., Korst, J.: Simulated annealing and boltzmann machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley and Sons, New York (1990)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1020551011615","volume":"23","author":"C. Gil","year":"2002","unstructured":"Gil, C., Ortega, J., Montoya, M.G., Basnos, R.: A mixed heuristic for circuit partitioning. Computational Optimization and Applications\u00a023, 321\u2013340 (2002)","journal-title":"Computational Optimization and Applications"},{"key":"1_CR24","unstructured":"Batagelj, V., Zaversnik, M.: Generalized cores. Journal of the ACM, 1\u20138 (2002)"},{"key":"1_CR25","first-page":"70","volume-title":"Tabu search: Modern heuristic techniques for combinatorial problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., Manuel, L.: Tabu search: Modern heuristic techniques for combinatorial problems, pp. 70\u2013150. Blackwell Scientific Publications, Oxford (1993)"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74198-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:06:44Z","timestamp":1737364004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74198-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741954","9783540741985"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74198-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}