{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:06:26Z","timestamp":1725469586205},"reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387344027"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34403-9_41","type":"book-chapter","created":{"date-parts":[[2006,8,29]],"date-time":"2006-08-29T22:21:44Z","timestamp":1156890104000},"page":"294-303","source":"Crossref","is-referenced-by-count":2,"title":["An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning"],"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"}]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_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, Vol. 19(1995)1\u201318","journal-title":"the VLSI Journal"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C, Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. Proc. ACM Conf Information and Knowledge Management (2001)","DOI":"10.2172\/816202"},{"key":"41_CR3","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. SI AM Journal on Scientific Computing, Vol. 16 (1995) 452\u2013469","journal-title":"SI AM Journal on Scientific Computing"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Wanschoor, R., Aubanel, E.: Mesh Partitioning for Computational Grids. Proc. 2nd Annual Conf on Communication Networks and Services Research (2004)","DOI":"10.1109\/DNSR.2004.1344745"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Ding, C, Xiaofeng, H., Hongyuan, Z., Ming, G., Simon, H.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. Proc. IEEE Conf Data Mining (2001) 107\u2013114","DOI":"10.1109\/ICDM.2001.989507"},{"key":"41_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":"41_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, Vol. 42 (1992) 153\u2013159","journal-title":"Information Processing Letters"},{"key":"41_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, Vol. 49 (1970) 291\u2013307","journal-title":"Bell System Technical Journal"},{"key":"41_CR9","unstructured":"Fiduccia, C, Mattheyses, R.: A Linear-Time Heuristics for Improving Network Partitions. Proc. 19th Design Automation Conf (1982) 175\u2013181"},{"key":"41_CR10","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":"41_CR11","first-page":"12","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, Vol. 20 (1999) 12.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"41_CR12","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, Vol. 25 (2006) 504\u2013517","journal-title":"IEEE Trans. Computer Aided Design"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/TC.2004.3","volume":"53","author":"Y.G. Saab","year":"2004","unstructured":"Saab, Y.G.: An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs. IEEE Trans. Computers, Vol. 53 (2004) 641\u2013653","journal-title":"IEEE Trans. Computers"},{"key":"41_CR14","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. Blackwell Scientific Publications Oxford (1993) 70\u2013150"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Alpert, C.J.: The ISPD98 Circuit benchmark suite. Proc. Intel Symposium of Physical Design (1998) 80\u201385","DOI":"10.1145\/274535.274546"}],"container-title":["IFIP International Federation for Information Processing","Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34403-9_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T01:25:10Z","timestamp":1619486710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34403-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387344027"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/0-387-34403-9_41","relation":{},"subject":[]}}