{"id":"https://openalex.org/W1572441411","doi":"https://doi.org/10.1007/s00453-001-0070-2","title":"A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem","display_name":"A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem","publication_year":2002,"publication_date":"2002-02-01","ids":{"openalex":"https://openalex.org/W1572441411","doi":"https://doi.org/10.1007/s00453-001-0070-2","mag":"1572441411"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0070-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0070-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"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":"https://openalex.org/A5097877542","display_name":"Kamidoi","orcid":null},"institutions":[{"id":"https://openalex.org/I57930482","display_name":"Hiroshima City University","ror":"https://ror.org/001et4e78","country_code":"JP","type":"education","lineage":["https://openalex.org/I57930482"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kamidoi","raw_affiliation_strings":["Faculty of Information Sciences, Hiroshima City University,  3-4-1 Ozuka-higashi, Asaminami-ku, Hiroshima 731-3194, Japan.  yoko@ce.hiroshima-cu.ac.jp., JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Sciences, Hiroshima City University,  3-4-1 Ozuka-higashi, Asaminami-ku, Hiroshima 731-3194, Japan.  yoko@ce.hiroshima-cu.ac.jp., JP","institution_ids":["https://openalex.org/I57930482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113938240","display_name":"Wakabayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wakabayashi","raw_affiliation_strings":["Graduate School of Engineering,  Hiroshima University,  4-1 Kagamiyama 1 chome, Higashi-Hiroshima 739-8597, Japan.  wakaba@ecs.hiroshima-u.ac.jp., JP","Graduate School of Engineering, Hiroshima University, 4-1 Kagamiyama 1 chome, Higashi-Hiroshima 739-8597, Japan. wakaba@ecs.hiroshima-u.ac.jp., JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering,  Hiroshima University,  4-1 Kagamiyama 1 chome, Higashi-Hiroshima 739-8597, Japan.  wakaba@ecs.hiroshima-u.ac.jp., JP","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, 4-1 Kagamiyama 1 chome, Higashi-Hiroshima 739-8597, Japan. wakaba@ecs.hiroshima-u.ac.jp., JP","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111454837","display_name":"Yoshida","orcid":null},"institutions":[{"id":"https://openalex.org/I57930482","display_name":"Hiroshima City University","ror":"https://ror.org/001et4e78","country_code":"JP","type":"education","lineage":["https://openalex.org/I57930482"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshida","raw_affiliation_strings":["Faculty of Information Sciences, Hiroshima City University,  3-4-1 Ozuka-higashi, Asaminami-ku, Hiroshima 731-3194, Japan.  yoko@ce.hiroshima-cu.ac.jp., JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Sciences, Hiroshima City University,  3-4-1 Ozuka-higashi, Asaminami-ku, Hiroshima 731-3194, Japan.  yoko@ce.hiroshima-cu.ac.jp., JP","institution_ids":["https://openalex.org/I57930482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.0663681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"32","issue":"2","first_page":"262","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9785000085830688,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9254999756813049,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.8758111596107483},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7545926570892334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6904152035713196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.676322877407074},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6491221785545349},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.645099401473999},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.613074541091919},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5594004988670349},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5391109585762024},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5336350202560425},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.496615469455719},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.45275282859802246},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41662511229515076},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.2857079803943634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2695653438568115}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.8758111596107483},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7545926570892334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6904152035713196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.676322877407074},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6491221785545349},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.645099401473999},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.613074541091919},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5594004988670349},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5391109585762024},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5336350202560425},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.496615469455719},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.45275282859802246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41662511229515076},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2857079803943634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2695653438568115}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-001-0070-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0070-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:repository.kulib.kyoto-u.ac.jp:2433/61161","is_oa":false,"landing_page_url":"http://hdl.handle.net/2433/61161","pdf_url":null,"source":{"id":"https://openalex.org/S4306401454","display_name":"Kyoto University Research Information Repository (Kyoto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I22299242","host_organization_name":"Kyoto University","host_organization_lineage":["https://openalex.org/I22299242"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Departmental Bulletin Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1542177083","https://openalex.org/W1561002358","https://openalex.org/W1977545325","https://openalex.org/W1983096342","https://openalex.org/W2035228443","https://openalex.org/W2065901967","https://openalex.org/W2066159238","https://openalex.org/W2115049345","https://openalex.org/W2115772827","https://openalex.org/W2122466336","https://openalex.org/W2131380753","https://openalex.org/W2152986618","https://openalex.org/W2167637346","https://openalex.org/W2340365916"],"related_works":["https://openalex.org/W3141688457","https://openalex.org/W2590727506","https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W2095284441","https://openalex.org/W3155269421","https://openalex.org/W2121204510","https://openalex.org/W1974018476","https://openalex.org/W647071796","https://openalex.org/W1572441411"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}