{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:56:12Z","timestamp":1743137772533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319784540"},{"type":"electronic","value":"9783319784557"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78455-7_3","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Algorithms for a Graph Partitioning Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3091-3823","authenticated-orcid":false,"given":"S.","family":"Vaishali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4231-0280","authenticated-orcid":false,"given":"M. S.","family":"Atulya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"3_CR1","unstructured":"Madkour, A.-R., Nadolny, P., Wright, M.: Finding Minimal Spanning Forests in a Graph. arXiv:1705.00774v1 (2017)"},{"key":"3_CR2","unstructured":"Frederickson, G.N., Zhou, S.: Optimal Parametric Search for Path and Tree Partitioning. arXiv:1711.00599v1 (2017)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1147\/rd.183.0217","volume":"18","author":"JA Lukes","year":"1974","unstructured":"Lukes, J.A.: Efficient algorithm for the partitioning of trees. IBM J. Res. Dev. 18, 217\u2013224 (1974)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/322234.322236","volume":"28","author":"Y Perl","year":"1981","unstructured":"Perl, Y., Schach, S.R.: Max-min tree partitioning. J. ACM 28, 5\u201315 (1981)","journal-title":"J. ACM"},{"key":"3_CR5","unstructured":"Frederickson, G.N.: Optimal algorithms for partitioning trees and locating p-centers in trees. Technical report CSD-TR-1029, Purdue University (1990)"},{"key":"3_CR6","unstructured":"Frederickson, G.N.: Optimal algorithms for tree partitioning. In: Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 168\u2013177, January 1991"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"An, Z., Feng, Q., Kanj, I., Xia, G.: The Complexity of Tree Partitioning. arXiv:1704.05896v1 (2017)","DOI":"10.1007\/978-3-319-62127-2_4"},{"key":"3_CR8","unstructured":"Caraballo, L.E., Diaz-B\u00e1\u00f1ez, J.-M., Kroher, N.: A Polynomial Algorithm for Balanced Clustering via Graph Partitioning. arXiv:1801.03347v2 (2018)"},{"key":"3_CR9","unstructured":"Lesnick, M., Wright, M.: Interactive Visualization of 2-D Persistence Modules. arXiv:1512.00180 (2015)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M Furer","year":"1994","unstructured":"Furer, M., Raghvachari, B.: Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms 17(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Formin","year":"2010","unstructured":"Formin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"key":"3_CR12","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:14Z","timestamp":1709810954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}