{"id":"https://openalex.org/W1992485864","doi":"https://doi.org/10.1145/1806689.1806767","title":"Augmenting undirected node-connectivity by one","display_name":"Augmenting undirected node-connectivity by one","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W1992485864","doi":"https://doi.org/10.1145/1806689.1806767","mag":"1992485864"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806767","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049428164","display_name":"L\u00e1szl\u00f3 A. V\u00e9gh","orcid":"https://orcid.org/0000-0003-1152-200X"},"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":"L\u00e1szl\u00f3 A. V\u00e9gh","raw_affiliation_strings":["Eotvos Lorand University, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eotvos Lorand University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049428164"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":2.8178,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90537737,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"563","last_page":"572"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9976000189781189,"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/node","display_name":"Node (physics)","score":0.750395655632019},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6844086050987244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.580508828163147},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5724032521247864},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5345168709754944},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45278167724609375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.416535884141922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4110448360443115},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3849988579750061},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36526983976364136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35722410678863525},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35566169023513794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31325626373291016},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.057693272829055786}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.750395655632019},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6844086050987244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.580508828163147},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5724032521247864},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5345168709754944},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45278167724609375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.416535884141922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4110448360443115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3849988579750061},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36526983976364136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35722410678863525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35566169023513794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31325626373291016},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.057693272829055786},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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":1,"locations":[{"id":"doi:10.1145/1806689.1806767","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1465058481","https://openalex.org/W1520479211","https://openalex.org/W1522552921","https://openalex.org/W1988132050","https://openalex.org/W2002782549","https://openalex.org/W2015382802","https://openalex.org/W2028334693","https://openalex.org/W2028942728","https://openalex.org/W2029687674","https://openalex.org/W2038041864","https://openalex.org/W2042275390","https://openalex.org/W2048815229","https://openalex.org/W2049754879","https://openalex.org/W2055190621","https://openalex.org/W2067818080","https://openalex.org/W2106199941","https://openalex.org/W2116510876","https://openalex.org/W2135211390","https://openalex.org/W2148517677","https://openalex.org/W2149935452","https://openalex.org/W2398523608","https://openalex.org/W2988480584","https://openalex.org/W3152018206","https://openalex.org/W4234462414","https://openalex.org/W4300273322"],"related_works":["https://openalex.org/W2170725231","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2147954430","https://openalex.org/W4299801389","https://openalex.org/W2031552172","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1774334694","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,28],"present":[1],"a":[2,13,19],"min-max":[3],"formula":[4],"for":[5,23,35],"the":[6,10,31],"problem":[7],"of":[8,12],"augmenting":[9],"node-connectivity":[11],"graph":[14],"by":[15],"one":[16],"and":[17],"give":[18],"polynomial":[20],"time":[21],"algorithm":[22],"finding":[24],"an":[25],"optimal":[26],"solution.":[27],"also":[29],"solve":[30],"minimum":[32],"cost":[33,37],"version":[34],"node-induced":[36],"functions.":[38]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}