{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:28:17Z","timestamp":1737437297213,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_6","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"60-69","source":"Crossref","is-referenced-by-count":3,"title":["An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning"],"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":"6_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":"6_CR2","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing\u00a016, 452\u2013469 (1995)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/ICDM.2001.989507","volume-title":"Proc. IEEE Conf. Data Mining","author":"C. Ding","year":"2001","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. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Khannat, G., Vydyanathant, N.: A hypergraph partitioning based approach for scheduling of tasks with batch-shared I\/O. In: IEEE International Symposium on Cluster Computing and the Grid, pp. 792\u2013799 (2005)","DOI":"10.1109\/CCGRID.2005.1558643"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"T. Bui","year":"1992","unstructured":"Bui, T., Leland, C.: Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters\u00a042, 153\u2013159 (1992)","journal-title":"Information Processing Letters"},{"key":"6_CR6","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":"6_CR7","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":"6_CR8","doi-asserted-by":"crossref","unstructured":"Tao, L., Zhao, Y.C., Thulasiraman, K., Swamy, M.N.S.: Simulated annealing and tabu search algorithms for multiway graph partition. Journal of Circuits, Systems and Computers, 159\u2013185 (1992)","DOI":"10.1142\/S021812669200012X"},{"key":"6_CR9","unstructured":"\u017bola, J., Wyrzykowski, R.: Application of genetic algorithm for mesh partitioning. In: Proc. Workshop on Parallel Numerics, pp. 209\u2013217 (2000)"},{"key":"6_CR10","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, pp. 103\u2013115 (1996)","DOI":"10.1016\/0965-9978(96)00011-7"},{"key":"6_CR11","series-title":"IFIP Series","first-page":"294","volume-title":"The IFIP TC5 International Conference on Knowledge Enterprise","author":"M. Leng","year":"2006","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, Heidelberg (2006)"},{"key":"6_CR12","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":"6_CR13","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":"6_CR14","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 highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020, 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"6_CR15","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":"6_CR16","doi-asserted-by":"crossref","unstructured":"Koros\u0303ec, P., S\u0303ilc, J., Robic\u0303, B.: Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Computing, 785\u2013801 (2004)","DOI":"10.1016\/j.parco.2003.12.016"},{"key":"6_CR17","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":"6_CR18","volume-title":"Artificial Life III","author":"M. Millonas","year":"1994","unstructured":"Millonas, M.: Swarms, phase transitions, and collective intelligence. In: Langton, C. (ed.) Artificial Life III, Addison-Wesley, Reading (1994)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. on SMC, 29\u201341 (1996)","DOI":"10.1109\/3477.484436"},{"key":"6_CR20","first-page":"1942","volume-title":"Proc. IEEE Conf. Neural Networks IV","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. IEEE Conf. Neural Networks IV, pp. 1942\u20131948. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/3-540-48304-7_82","volume-title":"Advances in Artificial Life","author":"A.E. Langham","year":"1999","unstructured":"Langham, A.E., Grant, P.W.: Using competing ant colonies to solve k-way partitioning problems with foraging and raiding strategies. In: Floreano, D., Mondada, F. (eds.) ECAL 1999. LNCS, vol.\u00a01674, pp. 621\u2013625. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:01:59Z","timestamp":1737417719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}