{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:34:32Z","timestamp":1725543272049},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540370253"},{"type":"electronic","value":"9783540370260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811305_54","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T13:30:33Z","timestamp":1153920633000},"page":"493-500","source":"Crossref","is-referenced-by-count":7,"title":["An Effective Multi-level Algorithm 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":"54_CR1","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":"54_CR2","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. In: Proc. IEEE Conf Data Mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"54_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. WH Freeman, New York (1979)"},{"key":"54_CR4","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"},{"key":"54_CR5","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":"54_CR6","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":"54_CR7","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":"54_CR8","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":"54_CR9","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\u00a053, 641\u2013653 (2004)","journal-title":"IEEE Trans. Computers"},{"key":"54_CR10","unstructured":"Amine, A.B., Karypis, G.: Multilevel 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":"54_CR11","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":"54_CR12","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)"},{"key":"54_CR13","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":"54_CR14","unstructured":"Batagelj, V., Zavers\u0303nik, M.: An O(m) Algorithm for cores decomposition of networks. Journal of the ACM, 799\u2013809 (2001)"},{"key":"54_CR15","unstructured":"Batagelj, V., Zavers\u0303nik, M.: Generalized cores. Journal of the ACM, 1\u20138 (2002)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811305_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:12:14Z","timestamp":1555747934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811305_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370253","9783540370260"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11811305_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}