{"id":"https://openalex.org/W1981743701","doi":"https://doi.org/10.1137/s0895480199364483","title":"Constrained Edge-Splitting Problems","display_name":"Constrained Edge-Splitting Problems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1981743701","doi":"https://doi.org/10.1137/s0895480199364483","mag":"1981743701"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480199364483","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199364483","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/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":true,"raw_author_name":"Tibor Jord\u00e1n","raw_affiliation_strings":["E\u00f6tv\u00f6s L\u00f3r\u00e1nd Tudom\u00e1nyegyetem"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"E\u00f6tv\u00f6s L\u00f3r\u00e1nd Tudom\u00e1nyegyetem","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113487275"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.11520164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"17","issue":"1","first_page":"88","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7993967533111572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7396516799926758},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6551668643951416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5068174004554749},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48218265175819397},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.47012102603912354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4120423495769501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09255760908126831}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7993967533111572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7396516799926758},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6551668643951416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5068174004554749},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48218265175819397},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.47012102603912354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4120423495769501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09255760908126831},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0895480199364483","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199364483","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.16.6269","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.6269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/RS/99/Ref/BRICS-RS-99-Ref/../../../../RS/99/37/BRICS-RS-99-37.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.4753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.4753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/RS/99/37/BRICS-RS-99-37.pdf","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":13,"referenced_works":["https://openalex.org/W1523852805","https://openalex.org/W1569752386","https://openalex.org/W1604158939","https://openalex.org/W1724540513","https://openalex.org/W1971486128","https://openalex.org/W2010478727","https://openalex.org/W2028957123","https://openalex.org/W2042275390","https://openalex.org/W2049754879","https://openalex.org/W2056006039","https://openalex.org/W2057575931","https://openalex.org/W2102671623","https://openalex.org/W2135211390"],"related_works":["https://openalex.org/W1719252778","https://openalex.org/W2031098440","https://openalex.org/W4307385446","https://openalex.org/W4386875525","https://openalex.org/W2466894780","https://openalex.org/W3092119098","https://openalex.org/W2003008160","https://openalex.org/W2381713449","https://openalex.org/W2731724293","https://openalex.org/W2904724461"],"abstract_inverted_index":{"Splitting":[0],"off":[1,42,101,196],"two":[2,150,248],"edges":[3,35,77,165,257],"su,sv":[4,11,102,191],"in":[5,22,43,45,177,197,202,205],"a":[6,14,46,48,108,123,127,189,220,236,252],"graph":[7,53],"G":[8,146,171,203],"means":[9],"deleting":[10],"and":[12,26,132,139,147,159,181,213,229],"adding":[13,251],"new":[15,109,143,256],"edge":[16],"uv.":[17],"Let":[18,170],"G=(V+s,E)":[19],"be":[20,29,40,149,173,184,194],"k-edge-connected":[21,174],"V":[23,57,178],"($k\\geq":[24],"2$)":[25,180],"let":[27,145,182],"d(s)":[28,183],"even.":[30,185],"Lov\u00e1sz":[31],"proved":[32],"that":[33,50,161],"the":[34,51,65,73,88,141,153,230,240,245],"incident":[36,166],"to":[37,79,107,167],"s":[38,97,168],"can":[39,193],"split":[41,76,195],"pairs":[44,92],"such":[47,68,219],"way":[49],"resulting":[52],"on":[54,134,152],"vertex":[55],"set":[56,74,89,155,254],"is":[58],"k-edge-connected.":[59],"In":[60],"this":[61,115,119],"paper":[62],"we":[63,121,234],"investigate":[64],"existence":[66],"of":[67,75,87,90,94,96,114,130,157,164,242,247,255,258],"complete":[69,136],"splitting":[70,100,137],"sequences":[71,138],"when":[72],"has":[78],"meet":[80],"additional":[81],"requirements.":[82],"We":[83],"prove":[84,140],"structural":[85],"properties":[86],"those":[91],"u,v":[93],"neighbors":[95],"for":[98,111,126,239],"which":[99,192],"destroys":[103],"k-edge-connectivity.":[104],"This":[105],"leads":[106],"method":[110,120],"solving":[112],"problems":[113],"type.":[116],"By":[117,224],"applying":[118],"obtain":[122],"short":[124],"proof":[125],"recent":[128],"result":[129],"Nagamochi":[131],"Eades":[133],"planarity-preserving":[135],"following":[142],"results:":[144],"H":[148],"graphs":[151,199,249],"same":[154],"V+s":[156],"vertices":[158],"suppose":[160],"their":[162],"sets":[163],"coincide.":[169],"(H)":[172],"(l-edge-connected,":[175],"respectively)":[176],"($k,l\\geq":[179],"Then":[186],"there":[187],"exists":[188],"pair":[190,221],"both":[198,216],"preserving":[200],"k-edge-connectivity":[201],"(l-edge-connectivity":[204],"H,":[206],"respectively),":[207],"provided":[208],"$d(s)\\geq":[209],"6$.":[210],"If":[211],"k":[212],"l":[214],"are":[215],"even,":[217],"then":[218],"always":[222],"exists.":[223],"using":[225],"these":[226],"edge-splitting":[227],"results":[228],"polymatroid":[231],"intersection":[232],"theorem":[233],"give":[235],"polynomial":[237],"algorithm":[238],"problem":[241],"simultaneously":[243],"augmenting":[244],"edge-connectivity":[246],"by":[250],"(common)":[253],"(almost)":[259],"minimum":[260],"size.":[261]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}