{"id":"https://openalex.org/W1967476329","doi":"https://doi.org/10.1137/100790239","title":"Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities","display_name":"Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1967476329","doi":"https://doi.org/10.1137/100790239","mag":"1967476329"},"language":"en","primary_location":{"id":"doi:10.1137/100790239","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100790239","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/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001781067","display_name":"Chun Kong Yung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chun Kong Yung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7449,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7178326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"42","issue":"3","first_page":"1185","last_page":"1200"},"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.9991000294685364,"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.9991000294685364,"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.9970999956130981,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9965999722480774,"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.6647664904594421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.622463583946228},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5812703371047974},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5806613564491272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.502837598323822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.489108145236969},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4442899823188782},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4246007204055786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16509601473808289},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09319433569908142}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6647664904594421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.622463583946228},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5812703371047974},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5806613564491272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.502837598323822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.489108145236969},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4442899823188782},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4246007204055786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16509601473808289},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09319433569908142},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100790239","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100790239","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":16,"referenced_works":["https://openalex.org/W1483203801","https://openalex.org/W1786780942","https://openalex.org/W1980942794","https://openalex.org/W1984188921","https://openalex.org/W1996575062","https://openalex.org/W2010478727","https://openalex.org/W2017501272","https://openalex.org/W2020163691","https://openalex.org/W2047053799","https://openalex.org/W2049754879","https://openalex.org/W2083365145","https://openalex.org/W2097945626","https://openalex.org/W2115049345","https://openalex.org/W2116598440","https://openalex.org/W2313441277","https://openalex.org/W2608846391"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W2281248943","https://openalex.org/W3102538728"],"abstract_inverted_index":{"We":[0,13,62],"present":[1],"new":[2,66],"edge":[3,35,89],"splitting-off":[4,36,90],"results":[5],"maintaining":[6],"all-pairs":[7],"edge-connectivities":[8],"of":[9,19,60],"an":[10,16],"undirected":[11],"graph.":[12],"first":[14],"give":[15],"alternate":[17],"proof":[18],"Mader's":[20],"theorem,":[21],"and":[22,69],"use":[23,70],"it":[24,71],"to":[25,72,78,96],"obtain":[26,79],"a":[27,58,65,80],"deterministic":[28],"$\\tilde{O}(m":[29,82],"+":[30,83],"{r_{\\max}}^2":[31],"\\cdot":[32,85],"n^2)$-time":[33],"complete":[34],"algorithm":[37,54,77],"for":[38],"unweighted":[39],"graphs,":[40],"where":[41],"$r_{\\max}$":[42],"denotes":[43],"the":[44,51,76],"maximum":[45],"edge-connectivity":[46],"requirement.":[47],"This":[48],"improves":[49],"upon":[50],"best":[52],"known":[53],"by":[55,57],"Gabow":[56],"factor":[59],"$\\tilde{\\Omega}(n)$.":[61],"then":[63],"prove":[64],"structural":[67],"property,":[68],"further":[73],"speed":[74,97],"up":[75,98],"randomized":[81],"{r_{\\max}}^3":[84],"n)$-time":[86],"algorithm.":[87],"These":[88],"algorithms":[91],"can":[92],"be":[93],"used":[94],"directly":[95],"various":[99],"graph":[100],"algorithms.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}