{"id":"https://openalex.org/W2008562682","doi":"https://doi.org/10.1142/s179383091250036x","title":"BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS","display_name":"BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS","publication_year":2012,"publication_date":"2012-08-06","ids":{"openalex":"https://openalex.org/W2008562682","doi":"https://doi.org/10.1142/s179383091250036x","mag":"2008562682"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091250036x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250036x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5003125546","display_name":"Evangelos Kranakis","orcid":"https://orcid.org/0000-0002-8959-4428"},"institutions":[{"id":"https://openalex.org/I122879082","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29","country_code":"CA","type":"government","lineage":["https://openalex.org/I122879082"]},{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"EVANGELOS KRANAKIS","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada","Supported in part by NSERC and MITACS grants"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Supported in part by NSERC and MITACS grants","institution_ids":["https://openalex.org/I122879082"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058262792","display_name":"Danny Kriz\u0327anc","orcid":"https://orcid.org/0000-0002-0941-4010"},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANNY KRIZANC","raw_affiliation_strings":["Department of Mathematics and Computer Science, Wesleyan University, Middletown CT 06459, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Wesleyan University, Middletown CT 06459, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072175964","display_name":"Oscar Morales Ponce","orcid":null},"institutions":[{"id":"https://openalex.org/I122879082","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29","country_code":"CA","type":"government","lineage":["https://openalex.org/I122879082"]},{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"OSCAR MORALES PONCE","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada","Supported in part by CONACYT and NSERC grants"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Supported in part by CONACYT and NSERC grants","institution_ids":["https://openalex.org/I122879082"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085438222","display_name":"Ladislav Stacho","orcid":null},"institutions":[{"id":"https://openalex.org/I122879082","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29","country_code":"CA","type":"government","lineage":["https://openalex.org/I122879082"]},{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"LADISLAV STACHO","raw_affiliation_strings":["Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, V5A 1S6, Canada","Supported in part by NSERC grant"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Supported in part by NSERC grant","institution_ids":["https://openalex.org/I122879082"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7172,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77556679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"04","issue":"03","first_page":"1250036","last_page":"1250036"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9951000213623047,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7101687788963318},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6785345673561096},{"id":"https://openalex.org/keywords/geometric-graph-theory","display_name":"Geometric graph theory","score":0.5978399515151978},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.550150454044342},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.46564018726348877},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.4646240174770355},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4503636360168457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4452393054962158},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4125223159790039},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.4111334979534149},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.33357763290405273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.331081748008728},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17246752977371216}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7101687788963318},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6785345673561096},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.5978399515151978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.550150454044342},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.46564018726348877},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.4646240174770355},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4503636360168457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4452393054962158},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4125223159790039},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.4111334979534149},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.33357763290405273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.331081748008728},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17246752977371216}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383091250036x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250036x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5299999713897705,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1969131636","https://openalex.org/W2063013286","https://openalex.org/W2067818080","https://openalex.org/W2098823334","https://openalex.org/W2116510876","https://openalex.org/W4205300528","https://openalex.org/W4234462414"],"related_works":["https://openalex.org/W2133160845","https://openalex.org/W2011729204","https://openalex.org/W3101895193","https://openalex.org/W2112065783","https://openalex.org/W4226287252","https://openalex.org/W2114785943","https://openalex.org/W2741008216","https://openalex.org/W4308233685","https://openalex.org/W3217284998","https://openalex.org/W3208080869"],"abstract_inverted_index":{"2-Edge":[0],"connectivity":[1,70,91],"is":[2,180,225,228,305],"an":[3,212],"important":[4],"fault":[5],"tolerance":[6],"property":[7],"of":[8,19,46,50,71,110,120,131,155,164,172,191,202,211,214,250,253,284,293,302,335],"a":[9,20,32,235,240,254,261,272,276,333],"network":[10,14,84],"because":[11],"it":[12,105],"maintains":[13],"communication":[15],"despite":[16],"the":[17,72,83,118,153,157,177,189,208,215,222,247,290,294,323],"deletion":[18],"single":[21,76],"arbitrary":[22],"edge.":[23],"Planar":[24],"spanning":[25,47,126,344],"subgraphs":[26,49],"have":[27,341],"been":[28],"shown":[29,229],"to":[30,82,87,230,233,239,270,307],"play":[31],"significant":[33],"role":[34],"for":[35,347],"achieving":[36],"local":[37],"decentralized":[38],"routing":[39],"in":[40,148,267,311],"wireless":[41],"networks.":[42],"Existing":[43],"algorithmic":[44],"constructions":[45],"planar":[48,125,165,181,237,244,273,279,345],"unit":[51],"disk":[52],"graphs":[53,127,167],"(UDGs)":[54],"such":[55,198],"as":[56,86],"Minimum":[57],"Spanning":[58],"Tree,":[59],"Gabriel":[60],"Graph,":[61,64],"Nearest":[62],"Neighborhood":[63],"etc.":[65],"do":[66,325],"not":[67,92,102,142,326,340],"always":[68],"ensure":[69],"resulting":[73,178],"graph":[74,179,238,245,274,280],"under":[75],"edge":[77,90,96,136,158,213,292],"deletion.":[78],"Furthermore,":[79],"adding":[80,129,161],"edges":[81,109,130,171,199,252,283],"so":[85,175],"improve":[88],"its":[89],"only":[93],"may":[94,106],"create":[95],"crossings":[97,137],"(at":[98,138],"points":[99,139],"which":[100,140,338],"are":[101,115,141],"vertices)":[103],"but":[104],"also":[107,219,259],"require":[108],"unbounded":[111],"length.":[112,257],"Thus":[113],"we":[114,151,313,331],"faced":[116],"with":[117,168,246,281],"problem":[119,154,317],"constructing":[121],"2-edge":[122,183,241,277,342],"connected":[123,242,278,343],"geometric":[124,166,236,243],"by":[128,287],"bounded":[132,173,256,286],"length":[133,174,203,210,285],"without":[134],"creating":[135],"vertices).":[143],"To":[144],"overcome":[145],"this":[146,149,316],"difficulty,":[147],"paper":[150],"address":[152],"augmenting":[156],"set":[159],"(i.e.,":[160],"new":[162,251],"edges)":[163],"straight":[169],"line":[170],"that":[176,197,221,265,300,315],"and":[182,218,310],"connected.":[184],"We":[185,258],"provide":[186,260,332],"bounds":[187],"on":[188],"number":[190,249],"newly":[192],"added":[193],"straight-line":[194,282],"edges,":[195],"prove":[196,314],"can":[200],"be":[201,231,319],"at":[204],"most":[205],"3":[206,224,288],"times":[207,289],"max":[209],"original":[216,295],"graph,":[217],"show":[220],"factor":[223],"optimal.":[226],"It":[227,297],"NP-Complete":[232],"augment":[234,271],"minimum":[248],"given":[255],"constant":[262],"time":[263],"algorithm":[264],"works":[266],"location-aware":[268],"settings":[269],"into":[275],"longest":[291],"graph.":[296],"turns":[298],"out":[299],"knowledge":[301],"vertex":[303],"coordinates":[304],"crucial":[306],"our":[308],"construction":[309],"fact":[312],"cannot":[318],"solved":[320],"locally":[321],"if":[322],"vertices":[324],"know":[327],"their":[328],"coordinates.":[329],"Moreover,":[330],"family":[334],"k-connected":[336],"UDGs":[337],"does":[339],"subgraphs,":[346],"any":[348],"[Formula:":[349],"see":[350],"text].":[351]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}