{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:27:42Z","timestamp":1743074862333,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75242-2_4","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"61-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconfiguration of Connected Graph Partitions via Recombination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6827-2200","authenticated-orcid":false,"given":"Hugo","family":"A. Akitaya","sequence":"first","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Korten","sequence":"additional","affiliation":[]},{"given":"Diane","family":"L. Souvaine","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8769-3190","authenticated-orcid":false,"given":"Csaba","family":"D. T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"A3340","DOI":"10.1137\/19M1295258","volume":"42","author":"T Abrishami","year":"2020","unstructured":"Abrishami, T., et al.: Geometry of graph partitions via optimal transport. SIAM J. Sci. Comput. 42(5), A3340\u2013A3366 (2020). https:\/\/doi.org\/10.1137\/19M1295258","journal-title":"SIAM J. Sci. Comput."},{"key":"4_CR2","unstructured":"Akitaya, H.A., et al.: Reconfiguration of connected graph partitions. Preprint (2019). http:\/\/arxiv.org\/abs\/1902.10765"},{"key":"4_CR3","unstructured":"Chataigner, F., Salgado, L.B., Wakabayashi, Y.: Approximation and inapproximability results on balanced connected partitions of graphs. Discret. Math. Theor. Comput. Sci. 9(1) (2007). http:\/\/dmtcs.episciences.org\/384"},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0020-0190(96)00175-5","volume":"60","author":"J Chleb\u00edkov\u00e1","year":"1996","unstructured":"Chleb\u00edkov\u00e1, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60(5), 223\u2013230 (1996). https:\/\/doi.org\/10.1016\/S0020-0190(96)00175-5","journal-title":"Inf. Process. Lett."},{"key":"4_CR5","unstructured":"DeFord, D.R., Duchin, M., Solomon, J.: Recombination: a family of Markov chains for redistricting. Preprint (2019). http:\/\/arxiv.org\/abs\/1911.05725"},{"key":"4_CR6","unstructured":"Duchin, M.: Gerrymandering metrics: how to measure? What\u2019s the baseline? Preprint (2018). https:\/\/arxiv.org\/abs\/1801.02064"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10(2), 139\u2013153 (1985). https:\/\/doi.org\/10.1016\/0166-218X(85)90008-3","journal-title":"Discrete Appl. Math."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Fifield, B., Higgins, M., Imai, K., Tarr, A.: Automated redistricting simulation using Markov chain Monte Carlo. J. Comput. Graph. Stat. 1\u201314 (2020). https:\/\/doi.org\/10.1080\/10618600.2020.1739532","DOI":"10.1080\/10618600.2020.1739532"},{"key":"4_CR9","unstructured":"Gy\u0151ri, E.: On division of graphs to connected subgraphs. In: Combinatorics (Proceedings of the Fifth Hungarian Combinatorial Colloquia, 1976, Keszthely), pp. 485\u2013494. Bolyai (1978)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1), 72\u201396 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.05.008","journal-title":"Theor. Comput. Sci."},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. AK Peters\/CRC Press, Wellesley (2009)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.jda.2005.01.005","volume":"4","author":"T Ito","year":"2006","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discrete Algorithms 4(1), 142\u2013154 (2006). https:\/\/doi.org\/10.1016\/j.jda.2005.01.005","journal-title":"J. Discrete Algorithms"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci. 43, 169\u2013188 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90174-X","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/net.21661","volume":"67","author":"I Lari","year":"2016","unstructured":"Lari, I., Ricca, F., Puerto, J., Scozzari, A.: Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria. Networks 67(1), 69\u201381 (2016). https:\/\/doi.org\/10.1002\/net.21661","journal-title":"Networks"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2017","unstructured":"Levin, D.A., Peres, Y.: Markov Chains and Mixing Times, 2nd edn. AMS, Providence (2017)","edition":"2"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning tress of a graph. Acta Mathematica Academiae Scientiarum Hungarica 30(3), 241\u2013251 (1977). https:\/\/doi.org\/10.1007\/BF01896190","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"4_CR17","unstructured":"Korman, M., Akitaya, H.A., Korten, O., Souvaine, D.L., T\u00f3th, C.D.: Reconfiguration of connected graph partitions via recombination. Preprint (2020). https:\/\/arxiv.org\/abs\/2011.07378"},{"key":"4_CR18","unstructured":"Najt, L., DeFord, D.R., Solomon, J.: Complexity and geometry of sampling connected graph partitions. Preprint (2019)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/3381419","volume":"16","author":"S Soltan","year":"2020","unstructured":"Soltan, S., Yannakakis, M., Zussman, G.: Doubly balanced connected graph partitioning. ACM Trans. Algorithms 16(2), 20:1\u201320:24 (2020). https:\/\/doi.org\/10.1145\/3381419","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"4_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H Suzuki","year":"1990","unstructured":"Suzuki, H., Takahashi, N., Nishizeki, T.: A linear algorithm for bipartition of biconnected graphs. Inf. Process. Lett. 33(5), 227\u2013231 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90189-5","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"WT Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82(1), 99\u2013116 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-57899-4_47","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K Wada","year":"1994","unstructured":"Wada, K., Kawaguchi, K.: Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 132\u2013143. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57899-4_47"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.tcs.2015.02.001","volume":"609","author":"D Wu","year":"2016","unstructured":"Wu, D., Zhang, Z., Wu, W.: Approximation algorithm for the balanced 2-connected $$k$$-partition problem. Theor. Comput. Sci. 609, 627\u2013638 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.02.001","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T22:04:44Z","timestamp":1620165884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","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":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}