{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:27:12Z","timestamp":1747654032209},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009764"},{"type":"electronic","value":"9783540366058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36605-9_14","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T21:03:42Z","timestamp":1193432622000},"page":"143-153","source":"Crossref","is-referenced-by-count":22,"title":["Multilevel Heuristic Algorithm for Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Raul","family":"Ba\u00f1os","sequence":"first","affiliation":[]},{"given":"Consolaci\u00f3n","family":"Gil","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Francisco G.","family":"Montoya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"issue":"1","key":"14_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., and Kahng, A., Recent Developments in Netlist Partitioning: A Survey. Integration: the VLSI Journal, 19\/ 1\u20132 (1995) 1\u201381.","journal-title":"Integration: the VLSI Journal"},{"key":"14_CR2","unstructured":"Banerjee, P.: Parallel Algorithms for VLSI Computer Aided Design. Prentice Hall, Englewoods Cliffs, NJ, 1994."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/1096-9128(20000425)12:5<311::AID-CPE492>3.0.CO;2-Q","volume":"12\/5","author":"C. Gil","year":"2000","unstructured":"Gil, C.; Ortega, J., and Montoya, M.G., Parallel VLSI Test in a Shared Memory Multiprocessors. Concurrency: Practice and Experience, 12\/5 (2000) 311\u2013326.","journal-title":"Concurrency: Practice and Experience"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Klenke, R.H., Williams, R.D., and Aylor, J.H., Parallel-Processing Techniques for Automatic Test Pattern Generation, IEEE Computer, (1992) 71\u201384.","DOI":"10.1109\/2.108056"},{"key":"14_CR5","unstructured":"Gil, C. and Ortega, J., A Parallel Test Pattern Generator based on Reed-Muller Spectrum, Euromicro Workshop on Parallel and Distributed Processing, IEEE (1997) 199\u2013204."},{"key":"14_CR6","unstructured":"Mobasher, B., Jain, N., Han, E.H., Srivastava J. Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of computer science, University of Minnesota, Minneapolis, 1996."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Shekhar S. and DLiu D.R.. Partitioning similarity graphs: A framework for declustering problems.Information Systems Journal, 21\/4, (1996)","DOI":"10.1016\/0306-4379(96)00024-5"},{"key":"14_CR8","unstructured":"Garey, M.R., and Johnson, D.S, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Company. San Francisco, 1979."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., and Lin, S., An Efficient Heuristic Procedure for Partitioning Graphics, The Bell Sys. Tech. Journal, (1970) 291\u2013307.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., and Mattheyses, R., A Linear Time Heuristic for Improving Network Partitions, In Proc. 19th IEEE Design Automation Conference, (1982) 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gilbert, J., Miller, G., and Teng, S., Geometric Mesh Partitioning: Implementation and Experiments, In Proceedings of International Parallel Processing Symposium, (1995).","DOI":"10.1109\/IPPS.1995.395965"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48\/1","author":"G. Karypis","year":"1998","unstructured":"Karypis, G. and Kumar V.: Multilevel K-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48\/1 (1998) 96\u2013129.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Cong, J., and Smith, M., A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design, In Proc. ACM\/IEEE Design Automation Conference, (1993) 755\u2013760.","DOI":"10.1145\/157485.165119"},{"key":"14_CR14","unstructured":"Schloegel, K., Karypis, G.; and Kumar, V., Graph Partitioning for High Performance Scientific Simulations, CRPC Parallel Computing Handbook, Morgan Kaufmann2000."},{"key":"14_CR15","unstructured":"Reeves, C.R., GeneticAlgorithms, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 151\u2013196."},{"key":"14_CR16","unstructured":"Soper, A.J., Walshaw, C., and Cross, M., A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning, Mathematics Research Report 00\/IM\/58, University of Greenwich, 2000."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1020551011615","volume":"23\/3","author":"C. Gil","year":"2002","unstructured":"Gil, C., Ortega, J., Montoya, M.G., and Banos R., A Mixed Heuristic for Circuit Partitioning. Computational Optimization and Applications Journal. 23\/3 (2002) 321\u2013340.","journal-title":"Computational Optimization and Applications Journal"},{"key":"14_CR18","unstructured":"Dowsland, K.A, Simulated Annealing, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 20\u201369."},{"key":"14_CR19","unstructured":"Glover, F., and Laguna, M., Tabu Search, in: C.R. Reeves (eds.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, London, 1993, 70\u2013150."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36605-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:51:28Z","timestamp":1556934688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36605-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009764","9783540366058"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36605-9_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}