{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:54:55Z","timestamp":1742799295666,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675532"},{"type":"electronic","value":"9783540454922"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45492-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T23:19:58Z","timestamp":1187219998000},"page":"81-88","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Iterative Method for Fast Network Partitioning"],"prefix":"10.1007","author":[{"given":"Chang-Sung","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Young-Min","family":"Song","sequence":"additional","affiliation":[]},{"given":"Sung-Up","family":"Jo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,12]]},"reference":[{"key":"9_CR1","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":"B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell Syst. Tech. J., Vol. 49, Feb. 1970, pp. 291\u2013307.","journal-title":"Bell Syst. Tech. J."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"C. M. Fiduccia and R. M. Mattheyses, A Linear Time Heuristic for Improving Network Partitions, Proc. 19th Design Automation Conf., 1982, pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"C-33","author":"B. Krishnamurthy","year":"1984","unstructured":"B. Krishnamurthy, An Improved Min-cut Algorithm for Partitioning VLSI Networks, IEEE Trans. on Computers, Vol. C-33, May 1984, pp. 438\u2013446.","journal-title":"IEEE Trans. on Computers"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0010-4485(93)90084-2","volume":"25","author":"J. U. Kim","year":"1993","unstructured":"J. U. Kim, C. H. Lee and M. H. Kim, An Efficient Multiple-way Network Partitioning Algorithm, Computer Aided Design, Vol. 25, Oct. 1993, pp. 269\u2013280..","journal-title":"Computer Aided Design"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/12.8730","volume":"C-38","author":"L. A. Sanchis","year":"1989","unstructured":"L. A. Sanchis, Multiple-way Network Partitioning, IEEE Trans. on Computers, Vol. C-38, Jan. 1989, pp. 62\u201381.","journal-title":"IEEE Trans. on Computers"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1109\/TC.1979.1675280","volume":"28","author":"H. J. Siegel","year":"1979","unstructured":"H. J. Siegel, A Model of SIMD Machines and a Comparison of Various Interconnection Networks, IEEE Trans. on Computers, Vol. 28, 1979 907\u2013917.","journal-title":"IEEE Trans. on Computers"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"C. K. Koc, A. Guvenc and B. Bakkaloglu, Exact Solution of Linear Equation on Distributed Memory Multiprocessors, Parallel Algorithms and Applications, Vol. 3, pp. 135\u2013143.","DOI":"10.1080\/10637199408962531"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"B. Murthy, K. Bhuvaneswari, and C. S. Murthy, A New Algorithm based on Givens Rotations Solving Linear Equations on Fault-Tolerant Mehs-Connected Processors, IEEE Trans. on Parallel and Distributed Systems, 1998, pp. 825\u2013832.","DOI":"10.1109\/71.706053"},{"key":"9_CR9","unstructured":"V. Kumar and et. al., Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin\/Cummings, 1994."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Q. M. Malluhi, M. A. Bayoumi and T. R. Rao, An Efficient Mapping of Multilayer Perception with Backpropataion Anns on Hypercubes, Proceedings of 5th IEEE symposium on Parallel and Distributed Processing, Dallas, Texas, 1993, pp. 368\u2013375.","DOI":"10.1109\/SPDP.1993.395509"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1006\/jpdc.1998.1514","volume":"56","author":"S. S. Gupta","year":"1999","unstructured":"S. S. Gupta and B. P. Sinha, A Simple O(logN) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs, Journal of Parallel and Distributed Computing 56, 1999, pp. 144\u2013155.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR12","first-page":"177","volume":"13","author":"K. D. Sajal","year":"1990","unstructured":"K. D. Sajal, Parallel Graph Algorithms for Hypercube, Parallel Computing, Vol. 13, 1990, pp. 177\u2013184.","journal-title":"Parallel Computing"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/10637199408962533","volume":"3","author":"R. A. Ayoubi","year":"1994","unstructured":"R. A. Ayoubi and M. A. Bayoumi, Bitonic Sort on the Connection Machine, Parallel Algorithms and Applications, Vol. 3, 1994, pp. 151\u2013161.","journal-title":"Parallel Algorithms and Applications"},{"key":"9_CR14","unstructured":"Y. Shih and J. Fier, Hypercube Systems and Key Applications, Parallel Processing for Supercomputing and AI, McGraw-Hill, 1990."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45492-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:14:52Z","timestamp":1737371692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45492-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675532","9783540454922"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45492-6_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}