{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:01Z","timestamp":1725558961100},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_31","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"365-376","source":"Crossref","is-referenced-by-count":2,"title":["Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J.: Easy problem for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms\u00a011(4), 631\u2013643 (1990)","journal-title":"J. Algorithms"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","volume":"144","author":"B. Bozkaya","year":"2003","unstructured":"Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. European J. Operational Research\u00a0144, 12\u201326 (2003)","journal-title":"European J. Operational Research"},{"key":"31_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"31_CR5","volume-title":"Digital Image Processing","author":"R.C. Gonzales","year":"1977","unstructured":"Gonzales, R.C., Wintz, P.: Digital Image Processing. Addison-Wesley, Reading (1977)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0206012","volume":"6","author":"S. Kundu","year":"1977","unstructured":"Kundu, S., Misra, J.: A linear tree-partitioning algorithm. SIAM J. Comput.\u00a06, 131\u2013134 (1977)","journal-title":"SIAM J. Comput."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","volume":"42","author":"M. Lucertini","year":"1993","unstructured":"Lucertini, M., Perl, Y., Simeone, B.: Most uniform path partitioning and its use in image processing. Discrete Applied Mathematics\u00a042, 227\u2013256 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"31_CR8","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\u00a028, 5\u201315 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM\u00a029(3), 623\u2013641 (1982)","journal-title":"J. ACM"},{"key":"31_CR10","volume-title":"Operating Systems","author":"D.C. Tsichritzis","year":"1981","unstructured":"Tsichritzis, D.C., Bernstein, P.A.: Operating Systems. Academic Press, New York (1981)"},{"key":"31_CR11","first-page":"12","volume":"74","author":"J.C. Williams Jr.","year":"1995","unstructured":"Williams Jr., J.C.: Political redistricting: a review. Papers in Regional Science\u00a074, 12\u201340 (1995)","journal-title":"Papers in Regional Science"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:02Z","timestamp":1619998202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}