{"id":"https://openalex.org/W1971486128","doi":"https://doi.org/10.1137/s0895480197324700","title":"Edge-Connectivity Augmentation with Partition Constraints","display_name":"Edge-Connectivity Augmentation with Partition Constraints","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1971486128","doi":"https://doi.org/10.1137/s0895480197324700","mag":"1971486128"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480197324700","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197324700","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/A5037418562","display_name":"J\u00f8rgen Bang\u2010Jensen","orcid":"https://orcid.org/0000-0001-5783-7125"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"JOrgen Bang-Jensen","raw_affiliation_strings":["[University of Southern Denmark]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[University of Southern Denmark]","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["University of Colorado \u2010 Boulder"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado \u2010 Boulder","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113487275","display_name":"Tibor Jord\u00e1n","orcid":"https://orcid.org/0000-0003-3662-5558"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tibor Jord\u00e1n","raw_affiliation_strings":["E\u00f6tv\u00f6s Lorand University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"E\u00f6tv\u00f6s Lorand University","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107639953","display_name":"Zolt\u00e1n Szigeti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Szigeti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.196,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.938199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"2","first_page":"160","last_page":"207"},"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.9998999834060669,"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.9998999834060669,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"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/combinatorics","display_name":"Combinatorics","score":0.7670361399650574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7112572193145752},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6547483205795288},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6399266123771667},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5474867224693298},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5121579170227051},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4707164168357849},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4602474272251129},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4212878942489624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42038092017173767},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3691580593585968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1388741135597229}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7670361399650574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7112572193145752},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6547483205795288},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6399266123771667},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5474867224693298},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5121579170227051},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4707164168357849},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4602474272251129},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4212878942489624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42038092017173767},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3691580593585968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1388741135597229},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480197324700","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197324700","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:sdu.dk:publications/08a95339-b7f5-4cad-b195-9298dc793e0a","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/08a95339-b7f5-4cad-b195-9298dc793e0a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bang-Jensen, J, Gabow, H N, Jordan, T & Szigeti, Z 1998, Edge-connectivity augmentation with partition constraints. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 306-315, Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 25/01/1998.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.4864","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.imada.ou.dk/pub/papers/pp-1997/32.ps.gz","raw_type":"text"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/3bbf7270-ba98-11dc-9626-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/3bbf7270-ba98-11dc-9626-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bang-Jensen , J , Gabow , H , Szigeti , Z & Jord\u00e1n , T 1999 , ' Edgeconnectivity augmentation with partition constraints ' , SIAM Journal on Discrete Mathematics , vol. 12 , pp. 160-207 . https://doi.org/10.1137/S0895480197324700","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1483203801","https://openalex.org/W1539230026","https://openalex.org/W1541536235","https://openalex.org/W1786780942","https://openalex.org/W2010478727","https://openalex.org/W2018480107","https://openalex.org/W2035228443","https://openalex.org/W2049754879","https://openalex.org/W2054815146","https://openalex.org/W2067818080","https://openalex.org/W2079573299","https://openalex.org/W2102671623","https://openalex.org/W2116598440","https://openalex.org/W2142542622","https://openalex.org/W4234462414"],"related_works":["https://openalex.org/W2391237956","https://openalex.org/W1487038674","https://openalex.org/W4301329442","https://openalex.org/W2953390393","https://openalex.org/W2324246115","https://openalex.org/W2151412766","https://openalex.org/W2583811263","https://openalex.org/W1598028160","https://openalex.org/W3173312668","https://openalex.org/W3012931947"],"abstract_inverted_index":{"In":[0],"the":[1,30,48,62,90,106,120,129,133,141,169,199,207,216,221,231,243,277],"well-solved":[2],"edge-connectivity":[3,63],"augmentation":[4],"problem":[5,93,121,135,186,222],"we":[6,78,167],"must":[7,37,257],"find":[8],"a":[9,19,44,65,95,103,137,179],"minimum":[10],"cardinality":[11],"set":[12],"F":[13,36],"of":[14,35,43,47,54,64,82,110,140,201,206,235,271,287],"edges":[15,205,263],"to":[16,18,23,68,89,215,276],"add":[17],"given":[20,45,208],"undirected":[21],"graph":[22,67],"make":[24],"it":[25,281],"k-edge-connected.":[26],"This":[27,211],"paper":[28],"solves":[29,184],"generalization":[31,139,146],"where":[32],"every":[33],"edge":[34,159],"go":[38],"between":[39],"two":[40],"different":[41],"sets":[42],"partition":[46,123,224],"vertex":[49],"set.":[50],"A":[51],"special":[52,76,104],"case":[53,77,105],"this":[55,75,145],"partition-constrained":[56,92,134],"problem,":[57,279],"previously":[58],"unsolved,":[59],"is":[60,127,136,150,160,164,213,228,253,270],"increasing":[61],"bipartite":[66],"k":[69,126,149,163,252],"while":[70],"preserving":[71],"bipartiteness.":[72],"Based":[73],"on":[74,230],"present":[79],"an":[80,174,283],"application":[81],"our":[83,185,255],"results":[84],"in":[85,187],"statics.":[86],"Our":[87,226,268],"solution":[88],"general":[91],"gives":[94],"min-max":[96,108,130],"formula":[97,109,131],"for":[98,119,132,220,242],"|F|":[99],"which":[100],"includes":[101],"as":[102],"original":[107],"Cai":[111],"and":[112,166,196,203],"Sun":[113],"[Networks,":[114],"19":[115],"(1989),":[116],"pp.":[117],"151--172]":[118],"without":[122,223],"constraints.":[124,225],"When":[125],"even":[128,273],"natural":[138],"unconstrained":[142,244,278],"version.":[143],"However,":[144,246],"fails":[147],"when":[148,162,251,274],"odd.":[151],"We":[152,177],"show":[153],"that":[154,171,183,260],"at":[155],"most":[156],"one":[157],"more":[158],"needed":[161],"odd":[165,254],"characterize":[168],"graphs":[170],"require":[172],"such":[173],"extra":[175],"edge.":[176],"give":[178],"strongly":[180],"polynomial":[181],"algorithm":[182,227,256,269],"time":[188,218],"O(n(m":[189],"+":[190],"nlog":[191],"n)log":[192],"n).":[193],"Here":[194],"n":[195],"m":[197],"denote":[198],"number":[200,286],"vertices":[202],"distinct":[204,288],"graph,":[209],"respectively.":[210],"bound":[212,219],"identical":[214],"best-known":[217],"based":[229],"splitting":[232,249],"off":[233],"technique":[234],"Lov\u00e1sz,":[236],"like":[237],"several":[238],"known":[239],"efficient":[240],"algorithms":[241],"problem.":[245],"unlike":[247],"previous":[248],"algorithms,":[250],"handle":[258],"obstacles":[259],"prevent":[261],"all":[262],"from":[264],"being":[265],"split":[266],"off.":[267],"interest":[272],"specialized":[275],"because":[280],"produces":[282],"asymptotically":[284],"optimum":[285],"splits.":[289]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}