{"id":"https://openalex.org/W2295788176","doi":"https://doi.org/10.5220/0005353500970107","title":"ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs","display_name":"ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2295788176","doi":"https://doi.org/10.5220/0005353500970107","mag":"2295788176"},"language":"en","primary_location":{"id":"doi:10.5220/0005353500970107","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005353500970107","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005353500970107","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101156710","display_name":"Lixin Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lixin Fu","raw_affiliation_strings":["University of North Carolina at Greensboro, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Greensboro, United States","institution_ids":["https://openalex.org/I169335092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048277494","display_name":"Jing Deng","orcid":"https://orcid.org/0000-0002-2508-1420"},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jing Deng","raw_affiliation_strings":["University of North Carolina at Greensboro, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Greensboro, United States","institution_ids":["https://openalex.org/I169335092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169335092"],"apc_list":null,"apc_paid":null,"fwci":0.4856,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60736196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976999759674072,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7127119898796082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.698243260383606},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6638134717941284},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4853438436985016},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4769529104232788},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4641052484512329},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44256851077079773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42027541995048523},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23720508813858032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19448629021644592},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1251119077205658},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08853772282600403}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7127119898796082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.698243260383606},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6638134717941284},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4853438436985016},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4769529104232788},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4641052484512329},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44256851077079773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42027541995048523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23720508813858032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19448629021644592},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1251119077205658},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08853772282600403}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005353500970107","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005353500970107","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005353500970107","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005353500970107","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Enterprise Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1506285740","https://openalex.org/W1550818239","https://openalex.org/W1968895412","https://openalex.org/W1972978715","https://openalex.org/W1994704968","https://openalex.org/W1994924587","https://openalex.org/W2005945380","https://openalex.org/W2006097619","https://openalex.org/W2018900730","https://openalex.org/W2045446569","https://openalex.org/W2098636939","https://openalex.org/W2099083325","https://openalex.org/W2100132188","https://openalex.org/W2111023939","https://openalex.org/W2118501802","https://openalex.org/W2126021606","https://openalex.org/W2146128955","https://openalex.org/W2147256592","https://openalex.org/W2157760787","https://openalex.org/W2159394589","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2227557434","https://openalex.org/W2283762717"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W4235240664","https://openalex.org/W2965083567","https://openalex.org/W1838576100","https://openalex.org/W2095886385","https://openalex.org/W2889616422","https://openalex.org/W2089704382","https://openalex.org/W1983399550","https://openalex.org/W97075385","https://openalex.org/W2357523926"],"abstract_inverted_index":{"Scalable":[0],"and":[1,125,148,175],"efficient":[2],"algorithms":[3],"are":[4,68,80,89,106],"needed":[5],"to":[6,28,49,82,92,95,154,170,186],"compute":[7],"shortest":[8,31],"paths":[9],"between":[10],"any":[11],"pair":[12],"of":[13,43],"vertices":[14],"in":[15,56,102,109,190],"large":[16,45,104,191],"social":[17,192],"graphs.":[18,193],"In":[19,47],"this":[20],"work,":[21],"we":[22,59,116],"propose":[23],"a":[24,37],"novel":[25],"ROBE":[26,33,167],"scheme":[27],"estimate":[29],"the":[30,41,44,51,57,84,93,98,103,110,118,135],"distances.":[32],"is":[34,138,168],"based":[35,133],"on":[36,134],"hub":[38,52,94,111,119,137],"serving":[39],"as":[40,159,161],"skeleton":[42],"graph.":[46,112],"order":[48],"stretch":[50],"into":[53],"every":[54],"corner":[55],"network,":[58],"first":[60],"choose":[61],"representative":[62,85],"nodes":[63,79,88],"with":[64,144,152],"highest":[65],"degrees":[66],"that":[67,97],"at":[69],"least":[70],"two":[71,172,181],"hops":[72],"away":[73],"from":[74],"each":[75],"other.":[76],"Then":[77],"bridge":[78],"selected":[81],"connect":[83],"nodes.":[86],"Extension":[87],"also":[90],"added":[91],"ensure":[96],"originally":[99],"connected":[100],"parts":[101],"graph":[105],"not":[107],"separated":[108],"To":[113],"improve":[114],"performance,":[115],"compress":[117],"through":[120,164],"chain":[121],"collapsing,":[122],"tentacle":[123],"retracting,":[124],"clique":[126],"compression":[127],"techniques.":[128],"A":[129],"query":[130],"evaluation":[131],"algorithm":[132],"compressed":[136],"given.":[139],"We":[140],"compare":[141],"our":[142],"approach":[143],"other":[145],"state-of-the-art":[146],"techniques":[147],"evaluate":[149],"their":[150],"performance":[151],"respect":[153],"miss":[155],"rate,":[156,158],"error":[157],"well":[160,189],"construction":[162],"time":[163],"extensive":[165],"simulations.":[166],"demonstrated":[169],"be":[171],"orders":[173],"faster":[174],"has":[176],"more":[177],"accurate":[178],"estimations":[179],"than":[180],"recent":[182],"algorithms,":[183],"allowing":[184],"it":[185],"scale":[187],"very":[188]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}