{"id":"https://openalex.org/W2096883999","doi":"https://doi.org/10.1109/iscas.2005.1465066","title":"Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph","display_name":"Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph","publication_year":2005,"publication_date":"2005-07-27","ids":{"openalex":"https://openalex.org/W2096883999","doi":"https://doi.org/10.1109/iscas.2005.1465066","mag":"2096883999"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2005.1465066","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2005.1465066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-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/A5054096253","display_name":"Satoshi Taoka","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"S. Taoka","raw_affiliation_strings":["Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101911738","display_name":"Takahiro Watanabe","orcid":"https://orcid.org/0000-0002-5742-5232"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Watanabe","raw_affiliation_strings":["Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023703640","display_name":"Toshiya Mashima","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131401","display_name":"Hiroshima International University","ror":"https://ror.org/03dk6an77","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210131401"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Mashima","raw_affiliation_strings":["Faculty of Infrastructural Technologies, Hiroshima International University, Kure, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Infrastructural Technologies, Hiroshima International University, Kure, Japan","institution_ids":["https://openalex.org/I4210131401"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054096253"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.17888798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1563","issue":null,"first_page":"2231","last_page":"2234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9965000152587891,"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/matching","display_name":"Matching (statistics)","score":0.7145986557006836},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6072317361831665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6046346426010132},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5782981514930725},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4950360357761383},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.46956968307495117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46847882866859436},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.46040356159210205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4480385184288025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4124250113964081},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.41231316328048706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39621713757514954},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24801483750343323},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20222815871238708},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1848912239074707},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09876364469528198}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7145986557006836},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6072317361831665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6046346426010132},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5782981514930725},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4950360357761383},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.46956968307495117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46847882866859436},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.46040356159210205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4480385184288025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4124250113964081},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.41231316328048706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39621713757514954},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24801483750343323},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20222815871238708},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1848912239074707},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09876364469528198},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2005.1465066","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2005.1465066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1513400187","https://openalex.org/W1534072310","https://openalex.org/W1579147021","https://openalex.org/W1905766196","https://openalex.org/W1978918340","https://openalex.org/W1981318539","https://openalex.org/W2002452451","https://openalex.org/W2012287357","https://openalex.org/W2019243533","https://openalex.org/W2024106841","https://openalex.org/W2051699458","https://openalex.org/W2059608229","https://openalex.org/W2067818080","https://openalex.org/W2090168101","https://openalex.org/W2092113566","https://openalex.org/W2113138058","https://openalex.org/W2124852572","https://openalex.org/W2125192982","https://openalex.org/W2340365916","https://openalex.org/W4233756358","https://openalex.org/W4247278211","https://openalex.org/W6645373679","https://openalex.org/W6655148981"],"related_works":["https://openalex.org/W2583914519","https://openalex.org/W2373360128","https://openalex.org/W2077309407","https://openalex.org/W1989856784","https://openalex.org/W2523984912","https://openalex.org/W2949886028","https://openalex.org/W1977306381","https://openalex.org/W2108769166","https://openalex.org/W2184969544","https://openalex.org/W4205343173"],"abstract_inverted_index":{"The":[0,28],"subject":[1],"of":[2,18,26,38,111,124],"the":[3,22,36,71,87,103],"paper":[4],"is":[5,96,100,113],"to":[6],"show":[7],"that,":[8],"by":[9,33,59,81],"utilizing":[10,82],"maximum-weight":[11,68,88],"matching":[12,89],"algorithms,":[13],"we":[14],"obtain":[15],"heuristic":[16],"algorithms":[17,40],"high":[19],"capability":[20],"for":[21,41,65,86],"k-edge-connectivity":[23],"augmentation":[24],"problem":[25],"graphs.":[27],"following":[29],"points":[30],"are":[31],"shown":[32,101],"experimentally":[34],"comparing":[35],"capabilities":[37],"eighteen":[39],"4,175":[42],"graphs":[43],"G'":[44],"=":[45],"(V,":[46],"E')":[47],"with":[48],"10/spl":[49],"les/|V|/spl":[50],"les/1400:":[51],"(1)":[52],"an":[53,63],"existing":[54],"algorithm,":[55,93],"FSM,":[56],"(previously":[57],"proposed":[58],"us),":[60],"based":[61],"on":[62],"algorithm":[64,85],"finding":[66],"a":[67,83,91],"matching,":[69],"produces":[70],"best":[72,105],"solutions,":[73],"while":[74],"it":[75,99],"becomes":[76],"unrealistic":[77],"when":[78],"|V|>1000;":[79],"(2)":[80],"2-approximation":[84],"problem,":[90],"promising":[92],"HBD/sub":[94],"a+/,":[95],"proposed,":[97],"and":[98],"that":[102,110,123],"second":[104],"solution":[106],"(average":[107,120],"1.017":[108],"times":[109,122],"FSM)":[112],"obtained":[114],"in":[115],"much":[116],"shorter":[117],"CPU":[118],"time":[119],"0.1":[121],"FSM).":[125]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}