{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:51:50Z","timestamp":1725882710765},"publisher-location":"Singapore","reference-count":4,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811031526"},{"type":"electronic","value":"9789811031533"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3153-3_24","type":"book-chapter","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T07:13:59Z","timestamp":1489648439000},"page":"241-249","source":"Crossref","is-referenced-by-count":0,"title":["Graph Partitioning Methods"],"prefix":"10.1007","author":[{"given":"Prabhu Dessai","family":"Tanvi","sequence":"first","affiliation":[]},{"given":"Rodrigues","family":"Okstynn","sequence":"additional","affiliation":[]},{"given":"Fernandes","family":"Sonia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,17]]},"reference":[{"key":"24_CR1","unstructured":"Vasilis Spyropoulos and Yannis Kotidis, \u201cDynamic Partitioning of Big Hierarchical Graph\u201d, IEEE Trans. On First International Workshop on Big Dynamic Distributed Data (DB3), Riva Del Grada, Italy, August 30, 2013."},{"key":"24_CR2","unstructured":"G. A. Ezhilarasi, K. S. Swarup, \u201cNetwork Decomposition using Kernighan Lin strategy aided harmony search algorithm\u201d, Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India."},{"key":"24_CR3","unstructured":"Andrew E. Caldwell, Andrew B. Kahng, and Igor. L. Markov, \u201cDesign and Implementation of Fiduccia Mattheyses Heuristic for VLSI Netlist Partitioning\u201d, UCLA Computer Science Dept., Los Angeles, CA 90095\u20131596."},{"key":"24_CR4","unstructured":"Zoltan Baruch, Octavian Cret, Kalman Pusztai, \u201cComparative Study of Circuit Partitioning Algorithm\u201d, MicroCAD 2000 International Computer Science Conference, Section F: Electrotechnics-Electronics, February-23\u201324, 2000, Miskole, Hungary."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3153-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T07:22:59Z","timestamp":1489648979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3153-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811031526","9789811031533"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3153-3_24","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]}}}