{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:25:56Z","timestamp":1764570356672},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717003"},{"type":"electronic","value":"9783540717010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71701-0_16","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T11:31:38Z","timestamp":1182339098000},"page":"138-149","source":"Crossref","is-referenced-by-count":13,"title":["An Effective Multi-level Algorithm Based on Ant Colony Optimization for Bisecting Graph"],"prefix":"10.1007","author":[{"given":"Ming","family":"Leng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songnian","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"25","volume-title":"Proc. ACM Conf Information and Knowledge Management","author":"H. Zha","year":"2001","unstructured":"Zha, H., et al.: Bipartite graph partitioning and data clustering. In: Proc. ACM Conf Information and Knowledge Management, pp. 25\u201332. ACM Press, New York (2001)"},{"key":"16_CR2","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., et al.: 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":"16_CR3","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. W.H. Freeman, New York (1979)"},{"key":"16_CR4","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":"16_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, 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"16_CR6","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":"16_CR7","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":"16_CR8","doi-asserted-by":"crossref","unstructured":"Tao, L., et al.: Simulated annealing and tabu search algorithms for multiway graph partition. Journal of Circuits, Systems and Computers, 159\u2013185 (1992)","DOI":"10.1142\/S021812669200012X"},{"key":"16_CR9","unstructured":"Kad\u0142uczka, P., Wala, K.: Tabu search and genetic algorithms for the generalized graph partitioning problem. Control and Cybernetics, 459\u2013476 (1995)"},{"key":"16_CR10","unstructured":"\u017bola, J., Wyrzykowski, R.: Application of genetic algorithm for mesh partitioning. In: Proc. Workshop on Parallel Numerics, pp. 209\u2013217 (2000)"},{"key":"16_CR11","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":"16_CR12","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":"16_CR13","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":"16_CR14","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":"16_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":"16_CR16","unstructured":"Amine, A.B., Karypis, G.: Multi-level algorithms for partitioning power-law graphs. Technical Report, Department of Computer Science, University of Minnesota, Available on the WWW at URL (2005), http:\/\/www.cs.umn.edu\/~metis"},{"key":"16_CR17","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":"16_CR18","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":"16_CR19","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella., L.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 53\u201366 (1997)","DOI":"10.1109\/4235.585892"},{"key":"16_CR20","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":"16_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)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks, 269\u2013287 (1983)","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"16_CR23","unstructured":"Batagelj, V., Zavers\u0303nik, M.: An O(m) Algorithm for cores decomposition of networks. Journal of the ACM, 799\u2013804 (2001)"},{"key":"16_CR24","unstructured":"Batagelj, V., Zavers\u0303nik, M.: Generalized cores. Journal of the ACM, 1\u20138 (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71701-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:54:17Z","timestamp":1619502857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71701-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717003","9783540717010"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71701-0_16","relation":{},"subject":[]}}