{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:25:46Z","timestamp":1764570346321,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738701"},{"type":"electronic","value":"9783540738718"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73871-8_8","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T18:14:18Z","timestamp":1187028858000},"page":"69-80","source":"Crossref","is-referenced-by-count":5,"title":["A New Multi-level Algorithm Based on Particle Swarm Optimization 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"}]},{"given":"Songnian","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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"},{"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)","key":"8_CR2","DOI":"10.1109\/CCGRID.2005.1558643"},{"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)","key":"8_CR3","DOI":"10.1109\/IJCNN.1999.833461"},{"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)","key":"8_CR4","DOI":"10.1109\/ICDM.2001.989507"},{"key":"8_CR5","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":"8_CR6","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":"8_CR7","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":"8_CR8","doi-asserted-by":"publisher","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"},{"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)","key":"8_CR9","DOI":"10.1109\/DAC.1982.1585498"},{"key":"8_CR10","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)"},{"unstructured":"\u017bola, J., Wyrzykowski, R.: Application of genetic algorithm for mesh partitioning. In: Proc. Workshop on Parallel Numerics, pp. 209\u2013217 (2000)","key":"8_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)","key":"8_CR12","DOI":"10.1016\/0965-9978(96)00011-7"},{"key":"8_CR13","series-title":"Lecture Notes in Artificial Intelligence","first-page":"138","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Leng","year":"2006","unstructured":"Leng, M., Yu, S.: An effective multi-level algorithm based on ant colony optimization for bisecting graph. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 138\u2013149. Springer, Heidelberg (2006)"},{"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), available on the WWW at URL http:\/\/www.cs.umn.edu\/~metis","key":"8_CR14"},{"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":"8_CR15"},{"doi-asserted-by":"crossref","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: Application in VLSI domain. In: Proc. Design Automation Conf., pp. 526\u2013529 (1997)","key":"8_CR16","DOI":"10.1109\/DAC.1997.597203"},{"doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104\u20134108 (1997)","key":"8_CR17","DOI":"10.1109\/ICSMC.1997.637339"},{"doi-asserted-by":"crossref","unstructured":"Alpert, C.J.: The ISPD 1998 circuit benchmark suite. In: Proc. Intel Symposium of Physical Design, pp. 80\u201385 (1998)","key":"8_CR18","DOI":"10.1145\/274535.274546"},{"doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. Proc. IEEE Conf. Neural Networks IV, pp. 1942\u20131948 (1995)","key":"8_CR19","DOI":"10.1109\/ICNN.1995.488968"},{"doi-asserted-by":"crossref","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks, 269\u2013287 (1983)","key":"8_CR20","DOI":"10.1016\/0378-8733(83)90028-X"},{"unstructured":"Batagelj, V., Zavers\u0303snik, M.: An O(m) Algorithm for cores decomposition of networks. Journal of the ACM, 799\u2013804 (2001)","key":"8_CR21"},{"unstructured":"Batagelj, V., Zavers\u0303nik, M.: Generalized cores. Journal of the ACM, 1\u20138 (2002)","key":"8_CR22"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73871-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:26:00Z","timestamp":1737365160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73871-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540738701","9783540738718"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73871-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}