{"id":"https://openalex.org/W1974139762","doi":"https://doi.org/10.1137/050631616","title":"A Deterministic Algorithm for Finding All Minimum <i>k</i>\u2010Way Cuts","display_name":"A Deterministic Algorithm for Finding All Minimum <i>k</i>\u2010Way Cuts","publication_year":2006,"publication_date":"2006-12-26","ids":{"openalex":"https://openalex.org/W1974139762","doi":"https://doi.org/10.1137/050631616","mag":"1974139762"},"language":"en","primary_location":{"id":"doi:10.1137/050631616","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050631616","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5063998723","display_name":"Yoko Kamidoi","orcid":"https://orcid.org/0000-0001-8690-0904"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoko Kamidoi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113622016","display_name":"Noriyoshi Yoshida","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Noriyoshi Yoshida","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073738140","display_name":"Hiroshi Nagamochi","orcid":"https://orcid.org/0000-0002-8332-1517"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hiroshi Nagamochi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4996,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.92146776,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"36","issue":"5","first_page":"1329","last_page":"1341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9955000281333923,"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/combinatorics","display_name":"Combinatorics","score":0.7778199315071106},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.660445511341095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6362147331237793},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6086772084236145},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6007267236709595},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5001592636108398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45533934235572815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44313159584999084},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42165857553482056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.400271475315094}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7778199315071106},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.660445511341095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6362147331237793},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6086772084236145},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6007267236709595},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5001592636108398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45533934235572815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44313159584999084},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42165857553482056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.400271475315094}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050631616","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050631616","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1529019776","https://openalex.org/W1572441411","https://openalex.org/W1971654255","https://openalex.org/W1974901680","https://openalex.org/W1984283136","https://openalex.org/W1995818744","https://openalex.org/W2025896589","https://openalex.org/W2026838540","https://openalex.org/W2035228443","https://openalex.org/W2041131084","https://openalex.org/W2048942741","https://openalex.org/W2056463115","https://openalex.org/W2059772103","https://openalex.org/W2065320942","https://openalex.org/W2071110640","https://openalex.org/W2084806590","https://openalex.org/W2090359754","https://openalex.org/W2104823067","https://openalex.org/W2121204510","https://openalex.org/W2122466336","https://openalex.org/W2152986618","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2915433949"],"related_works":["https://openalex.org/W2115772827","https://openalex.org/W4289685524","https://openalex.org/W2068595367","https://openalex.org/W2885987986","https://openalex.org/W115807216","https://openalex.org/W4235911878","https://openalex.org/W3210180238","https://openalex.org/W1447961680","https://openalex.org/W1490943871","https://openalex.org/W1974139762"],"abstract_inverted_index":{"Let":[0],"$G=(V,E)$":[1],"be":[2,62],"an":[3,42],"edge\u2010weighted":[4],"undirected":[5],"graph":[6],"with":[7],"n":[8],"vertices":[9],"and":[10,60],"m":[11],"edges.":[12],"We":[13],"present":[14],"a":[15,20,27,33,38,72],"deterministic":[16],"algorithm":[17,31,76],"to":[18,50,64],"compute":[19],"minimum":[21,46,55,80],"k\u2010way":[22,47,81],"cut":[23,48,58],"of":[24,44,53],"G":[25],"for":[26],"given":[28],"k.":[29],"Our":[30],"is":[32],"divide\u2010and\u2010conquer":[34],"method":[35],"based":[36],"on":[37],"procedure":[39],"that":[40],"reduces":[41],"instance":[43],"the":[45,54,75],"problem":[49],"$O(n^{2k-5})$":[51],"instances":[52],"$(\\lfloor":[56],"(k+\\sqrt{k})/2\\rfloor+1)$\u2010way":[57],"problem,":[59],"can":[61,77],"implemented":[63],"run":[65],"in":[66,83],"$O(n^{4k/(1-1.71/\\sqrt{k})":[67,84],"-31}":[68],")$":[69,86],"time.":[70,87],"With":[71],"slight":[73],"modification,":[74],"find":[78],"all":[79],"cuts":[82],"-16}":[85]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}