{"id":"https://openalex.org/W1969525246","doi":"https://doi.org/10.1016/0012-365x(94)00233-9","title":"Generalizing the all-pairs min cut problem","display_name":"Generalizing the all-pairs min cut problem","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1969525246","doi":"https://doi.org/10.1016/0012-365x(94)00233-9","mag":"1969525246"},"language":"en","primary_location":{"id":"doi:10.1016/0012-365x(94)00233-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0012-365x(94)00233-9","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0012-365x(94)00233-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[{"id":"https://openalex.org/I931278978","display_name":"College of Business Administration","ror":"https://ror.org/03x1zq178","country_code":"LV","type":"education","lineage":["https://openalex.org/I931278978"]},{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["LV","US"],"is_corresponding":true,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":["Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA","Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA#TAB#","institution_ids":["https://openalex.org/I931278978"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079559219"],"corresponding_institution_ids":["https://openalex.org/I107639228","https://openalex.org/I931278978"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":{"value":3000,"currency":"USD","value_usd":3000},"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.09261678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"147","issue":"1-3","first_page":"151","last_page":"169"},"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.9997000098228455,"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.9997000098228455,"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.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/matroid","display_name":"Matroid","score":0.8582062721252441},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.618232011795044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5968499183654785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.509383499622345},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.47891128063201904},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4590122103691101},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45042502880096436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4438704252243042},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.42853885889053345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2713192105293274},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.185724139213562},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06564480066299438},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.042806029319763184}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8582062721252441},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.618232011795044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5968499183654785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.509383499622345},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47891128063201904},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4590122103691101},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45042502880096436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4438704252243042},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.42853885889053345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2713192105293274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.185724139213562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06564480066299438},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.042806029319763184},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0012-365x(94)00233-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0012-365x(94)00233-9","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0012-365x(94)00233-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0012-365x(94)00233-9","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W82387719","https://openalex.org/W572096878","https://openalex.org/W606581564","https://openalex.org/W1551635709","https://openalex.org/W1964119857","https://openalex.org/W1981295749","https://openalex.org/W1996453957","https://openalex.org/W2015779878","https://openalex.org/W2070851851","https://openalex.org/W2071512825","https://openalex.org/W2115049345","https://openalex.org/W2125690626","https://openalex.org/W2127631842","https://openalex.org/W4213064273","https://openalex.org/W4251280006","https://openalex.org/W4285719527","https://openalex.org/W6609614040","https://openalex.org/W6645597773"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W2033011390","https://openalex.org/W2913125838","https://openalex.org/W2540764814"],"abstract_inverted_index":{"The":[0,70],"all-pairs":[1],"min":[2,20],"cut":[3,21],"(APMC)":[4],"problem":[5,48,92],"on":[6],"a":[7,19,31,77,94],"nonnegative":[8],"edge-weighted":[9],"graph":[10],"is":[11,76,93],"to":[12,52,65],"find,":[13],"for":[14],"each":[15],"pair":[16],"of":[17,34,36,63,72,80,82],"nodes,":[18],"that":[22,38,59,89],"separates":[23],"the":[24,40,46,61,90],"pair.":[25],"Gomory":[26,73],"and":[27,54,74],"Hu":[28,75],"(1961)":[29],"presented":[30],"structural":[32],"characterization":[33],"collections":[35],"cuts":[37],"solve":[39],"APMC":[41,47,91],"problem.":[42,69,97],"We":[43],"show":[44],"how":[45],"can":[49],"be":[50],"generalized":[51],"matroids":[53],"we":[55,87],"present":[56],"several":[57],"theorems":[58],"characterize":[60],"structure":[62],"solutions":[64],"this":[66],"more":[67],"general":[68],"result":[71],"special":[78],"case":[79],"one":[81],"these":[83],"theorems.":[84],"In":[85],"particular,":[86],"find":[88],"matroid":[95],"optimization":[96]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}