{"id":"https://openalex.org/W1990242001","doi":"https://doi.org/10.1093/ietisy/e90-d.2.449","title":"Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size","display_name":"Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size","publication_year":2007,"publication_date":"2007-02-01","ids":{"openalex":"https://openalex.org/W1990242001","doi":"https://doi.org/10.1093/ietisy/e90-d.2.449","mag":"1990242001"},"language":"en","primary_location":{"id":"doi:10.1093/ietisy/e90-d.2.449","doi":"https://doi.org/10.1093/ietisy/e90-d.2.449","is_oa":false,"landing_page_url":"https://doi.org/10.1093/ietisy/e90-d.2.449","pdf_url":null,"source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"T. ITO","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. ITO","raw_affiliation_strings":["The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":null,"display_name":"K. GOTO","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. GOTO","raw_affiliation_strings":["The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000614478","display_name":"Xiangqian Zhou","orcid":"https://orcid.org/0000-0002-0662-4792","observed_orcids":["https://orcid.org/0000-0002-0662-4792"]},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"X. ZHOU","raw_affiliation_strings":["The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033580185","display_name":"Takao Nishizeki","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. NISHIZEKI","raw_affiliation_strings":["The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The authors are with the Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980--8579 Japan. E-mail: take@nishizeki.ecei.tohoku.ac.jp","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201537933"],"apc_list":null,"apc_paid":null,"fwci":0.756,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73083263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":"E90-D","issue":"2","first_page":"449","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6830999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6830999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3163999915122986,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.8830000162124634},{"id":"https://openalex.org/keywords/uniform-partitions","display_name":"uniform partitions","score":0.7300000190734863},{"id":"https://openalex.org/keywords/connected-subgraphs","display_name":"connected subgraphs","score":0.8709999918937683},{"id":"https://openalex.org/keywords/edge-deletion","display_name":"edge deletion","score":0.8149999976158142},{"id":"https://openalex.org/keywords/series-parallel-graphs","display_name":"series-parallel graphs","score":0.8230000138282776},{"id":"https://openalex.org/keywords/partial-k-trees","display_name":"partial k-trees","score":0.9929999709129333},{"id":"https://openalex.org/keywords/bounded-treewidth","display_name":"bounded treewidth","score":0.7630000114440918},{"id":"https://openalex.org/keywords/pseudo-polynomial-time","display_name":"pseudo-polynomial time","score":0.8379999995231628},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7870000004768372}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.827810525894165},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6661642789840698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5627017617225647},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5588492155075073},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5491904020309448},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4726235866546631},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4635803699493408},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45497819781303406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43758103251457214},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4313628673553467},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/ietisy/e90-d.2.449","doi":"https://doi.org/10.1093/ietisy/e90-d.2.449","is_oa":false,"landing_page_url":"https://doi.org/10.1093/ietisy/e90-d.2.449","pdf_url":null,"source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2626844239","https://openalex.org/W2065410741","https://openalex.org/W191877893","https://openalex.org/W2584187496","https://openalex.org/W2996212809","https://openalex.org/W1598028160","https://openalex.org/W2069614077","https://openalex.org/W4388555903","https://openalex.org/W4255895919","https://openalex.org/W2965171438"],"abstract_inverted_index":{"Assume":[0],"that":[1,19,49,107,125],"each":[2,58,69],"vertex":[3],"of":[4,14,22,54,79],"a":[5,10,82],"graph":[6],"G":[7,39,47],"is":[8,60,85,91],"assigned":[9],"constant":[11],"number":[12],"q":[13,20,99],"nonnegative":[15,23],"integer":[16],"weights,":[17],"and":[18,26,64,90,110,122],"pairs":[21],"integers":[24],"li":[25,63],"ui,":[27],"1":[28,72],"\u2264":[29,31,73,75],"i":[30,74],"q,":[32],"are":[33],"given.":[34],"One":[35],"wishes":[36],"to":[37],"partition":[38,84],"into":[40],"connected":[41],"components":[42],"by":[43],"deleting":[44],"edges":[45],"from":[46],"so":[48],"the":[50,108],"total":[51],"i-th":[52],"weights":[53],"all":[55],"vertices":[56],"in":[57,116],"component":[59],"at":[61,65],"least":[62],"most":[66],"ui":[67],"for":[68,87,94,98,119],"index":[70],"i,":[71],"q.":[76],"The":[77],"problem":[78,109],"finding":[80],"such":[81],"uniform":[83],"NP-hard":[86,93],"series-parallel":[88,120],"graphs,":[89],"strongly":[92],"general":[95],"graphs":[96,121,127],"even":[97],"=":[100],"1.":[101],"In":[102],"this":[103],"paper":[104],"we":[105],"show":[106],"many":[111],"variants":[112],"can":[113],"be":[114],"solved":[115],"pseudo-polynomial":[117],"time":[118],"partial":[123],"k-trees,":[124],"is,":[126],"with":[128],"bounded":[129],"tree-width.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2025-10-10T00:00:00"}