{"id":"https://openalex.org/W2065901967","doi":"https://doi.org/10.1137/s0895480194271323","title":"Computing All Small Cuts in an Undirected Network","display_name":"Computing All Small Cuts in an Undirected Network","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2065901967","doi":"https://doi.org/10.1137/s0895480194271323","mag":"2065901967"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480194271323","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480194271323","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/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":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043512744","display_name":"Kazuhiro Nishimura","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kazuhiro Nishimura","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113496426","display_name":"Toshihide Ibaraki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toshihide Ibaraki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.557,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.89275843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"3","first_page":"469","last_page":"481"},"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.9994999766349792,"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.9994999766349792,"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.9965000152587891,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8793961405754089},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8198161125183105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6926591992378235},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.6746910810470581},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5211901068687439},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4737825393676758},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4180935323238373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3262345790863037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24209749698638916},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08538106083869934},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07815158367156982}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8793961405754089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8198161125183105},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6926591992378235},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.6746910810470581},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5211901068687439},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4737825393676758},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4180935323238373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3262345790863037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24209749698638916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08538106083869934},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07815158367156982},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480194271323","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480194271323","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.6782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.6782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-or.amp.i.kyoto-u.ac.jp/members/naga/./paper/siamdm.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W108232731","https://openalex.org/W1542177083","https://openalex.org/W1786780942","https://openalex.org/W2017501272","https://openalex.org/W2035228443","https://openalex.org/W2049754879","https://openalex.org/W2064211276","https://openalex.org/W2117889403"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W2288515165","https://openalex.org/W2140262267","https://openalex.org/W1951301781","https://openalex.org/W1997643965","https://openalex.org/W2216908642","https://openalex.org/W2065901967","https://openalex.org/W1885928367","https://openalex.org/W2068071044","https://openalex.org/W2262765272"],"abstract_inverted_index":{"Let":[0],"$\\lambda({\\cal":[1],"N})$":[2,68],"denote":[3,21],"the":[4,22,39,77,98],"weight":[5],"of":[6,24,41,63,100,102],"a":[7,53,93],"minimum":[8],"cut":[9],"in":[10,72,116],"an":[11,35],"edge-weighted":[12],"undirected":[13],"network":[14],"${\\cal":[15],"N}$,":[16],"and":[17,19,26,108],"n":[18],"m":[20],"numbers":[23],"vertices":[25],"edges,":[27],"respectively.":[28],"It":[29],"is":[30,34,52,92],"known":[31],"that":[32,60,89,109],"$O(n^{2k})$":[33],"upper":[36,95],"bound":[37,96],"on":[38,97],"number":[40,99],"cuts":[42,62,101,112],"with":[43],"weights":[44,64,103],"less":[45,65,104],"than":[46,66,105],"$k\\lambda({\\cal":[47,67,106],"N})$,":[48,107],"where":[49],"$k\\geq":[50],"1$":[51],"given":[54],"constant.":[55],"This":[56],"paper":[57,82],"first":[58],"shows":[59],"all":[61,110],"can":[69,113],"be":[70,114],"enumerated":[71,115],"$O(m^2n+n^{2k}m)$":[73],"time":[74],"without":[75],"using":[76],"maximum":[78],"flow":[79],"algorithm.":[80],"The":[81],"then":[83],"proves":[84],"for":[85],"$k":[86],"<":[87],"\\four$":[88],"$n\\choose":[90],"2$":[91],"tight":[94],"those":[111],"$O(m^2n+mn^2\\log":[117],"n)$":[118],"time.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}