{"id":"https://openalex.org/W2583267641","doi":"https://doi.org/10.1109/bigdata.2016.7840681","title":"Effective and efficient graph augmentation in large graphs","display_name":"Effective and efficient graph augmentation in large graphs","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2583267641","doi":"https://doi.org/10.1109/bigdata.2016.7840681","mag":"2583267641"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2016.7840681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2016.7840681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Big Data (Big Data)","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/A5090061509","display_name":"Ioanna Filippidou","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Ioanna Filippidou","raw_affiliation_strings":["Athens University of Economics and Business, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055320698","display_name":"Yannis Kotidis","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Yannis Kotidis","raw_affiliation_strings":["Athens University of Economics and Business, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090061509"],"corresponding_institution_ids":["https://openalex.org/I73142707"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15592674,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"880"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9980000257492065,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9941999912261963,"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/computer-science","display_name":"Computer science","score":0.6918278336524963},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5839442610740662},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4991776943206787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4913107454776764},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47104763984680176},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.42302340269088745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3789401948451996},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3368672728538513},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.278914213180542}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6918278336524963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5839442610740662},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4991776943206787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4913107454776764},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47104763984680176},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.42302340269088745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3789401948451996},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3368672728538513},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.278914213180542}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2016.7840681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2016.7840681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Big Data (Big Data)","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":21,"referenced_works":["https://openalex.org/W40194136","https://openalex.org/W815720198","https://openalex.org/W1580292412","https://openalex.org/W1973522621","https://openalex.org/W2015953751","https://openalex.org/W2022980325","https://openalex.org/W2040662757","https://openalex.org/W2053572557","https://openalex.org/W2077191553","https://openalex.org/W2107569009","https://openalex.org/W2112090702","https://openalex.org/W2114231102","https://openalex.org/W2126257795","https://openalex.org/W2196885578","https://openalex.org/W2270368980","https://openalex.org/W2273525595","https://openalex.org/W2407891964","https://openalex.org/W2755088640","https://openalex.org/W4234462414","https://openalex.org/W6634743436","https://openalex.org/W6744271739"],"related_works":["https://openalex.org/W3008760144","https://openalex.org/W2127060988","https://openalex.org/W2565761069","https://openalex.org/W2740693040","https://openalex.org/W2546858759","https://openalex.org/W3024161226","https://openalex.org/W2474823404","https://openalex.org/W2150221418","https://openalex.org/W2417093649","https://openalex.org/W3123878384","https://openalex.org/W2070593017","https://openalex.org/W2963924987","https://openalex.org/W3093521395","https://openalex.org/W2004344615","https://openalex.org/W3129345316","https://openalex.org/W1964419312","https://openalex.org/W2771142648","https://openalex.org/W2020657191","https://openalex.org/W2949550476","https://openalex.org/W3047022983"],"abstract_inverted_index":{"The":[0,99],"graph":[1,86,107,143],"augmentation":[2,87],"problem":[3,52,88],"seeks":[4],"to":[5,12,62,79,163],"suggest":[6],"new":[7],"edges":[8],"that,":[9],"when":[10],"added":[11],"an":[13,94,123],"input":[14,115],"graph,":[15],"improve":[16],"the":[17,21,27,33,39,51,57,70,84,114,132,141,146,169],"overall":[18],"connectivity":[19,58],"of":[20,50,69,113,126,148,173,178],"nodes.":[22],"For":[23],"social":[24],"network":[25],"applications,":[26],"latter":[28],"is":[29,93],"typically":[30],"computed":[31],"as":[32,145],"average":[34],"shortest":[35,150],"path":[36],"length":[37],"in":[38],"network.":[40],"In":[41],"this":[42,118],"work":[43],"we":[44,97],"first":[45,103],"introduce":[46],"one":[47],"interesting":[48],"variation":[49,92],"that":[53,75,108],"focuses":[54],"on":[55,176],"improving":[56],"between":[59],"nodes":[60,68],"belonging":[61],"a":[63,105],"specific":[64],"sub-graph":[65],"(for":[66],"instance":[67],"same":[71],"class":[72],"or":[73],"users":[74],"share":[76],"interests).":[77],"Key":[78],"our":[80,120,174],"method":[81],"for":[82,156],"solving":[83],"original":[85],"and":[89,171,181],"its":[90],"suggested":[91,127],"intuitive":[95],"algorithm":[96,100,121,134],"propose.":[98],"operates":[101],"by":[102],"constructing":[104],"summary":[106,119],"retains":[109],"important":[110],"structural":[111],"properties":[112],"graph.":[116],"Using":[117],"computes":[122],"effective":[124],"list":[125],"shortcuts.":[128],"Unlike":[129],"existing":[130,160],"techniques,":[131],"proposed":[133],"does":[135],"not":[136],"require":[137],"complex":[138],"computations":[139],"over":[140],"whole":[142],"(such":[144],"computation":[147],"all-pair":[149],"paths).":[151],"This":[152],"makes":[153],"it":[154],"applicable":[155],"larger":[157],"graphs":[158,177],"where":[159],"proposals":[161],"fail":[162],"operate.":[164],"Our":[165],"experimental":[166],"results":[167],"demonstrate":[168],"efficiency":[170],"effectiveness":[172],"techniques":[175],"various":[179],"sizes":[180],"characteristics.":[182]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}