{"id":"https://openalex.org/W2203674786","doi":null,"title":"Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs","display_name":"Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2203674786","mag":"2203674786"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.3477","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.3477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/hal-00735481/PDF/RR-8074-v2.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00735481","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112385998","display_name":"Nathann Cohen","orcid":"https://orcid.org/0000-0002-3341-3712","observed_orcids":["https://orcid.org/0000-0002-3341-3712"]},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathann Cohen","raw_affiliation_strings":["Laboratoire de Recherche en Informatique#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique#TAB#","institution_ids":["https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020955386","display_name":"David Coudert A","orcid":"https://orcid.org/0000-0002-3306-8314","observed_orcids":["https://orcid.org/0000-0002-3306-8314"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Coudert","raw_affiliation_strings":["Algorithms, simulation, combinatorics and optimization for telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms, simulation, combinatorics and optimization for telecommunications","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087814796","display_name":"Aur\u00e9lien Lancin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aur\u00e9lien Lancin","raw_affiliation_strings":["Algorithms, simulation, combinatorics and optimization for telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms, simulation, combinatorics and optimization for telecommunications","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3022,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.94812078,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9121000170707703,"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.9121000170707703,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.03269999846816063,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.025200000032782555,"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/exact-algorithms","display_name":"exact algorithms","score":0.6029999852180481},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.890999972820282},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.7900000214576721},{"id":"https://openalex.org/keywords/shortest-path-length","display_name":"shortest path length","score":0.7979999780654907},{"id":"https://openalex.org/keywords/caida","display_name":"CAIDA","score":0.7670000195503235},{"id":"https://openalex.org/keywords/dimes","display_name":"d\u00eeme","score":0.8859999775886536},{"id":"https://openalex.org/keywords/time-complexity-analysis","display_name":"time complexity analysis","score":0.6880000233650208}],"concepts":[{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5500756502151489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5156154036521912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4824441075325012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37536633014678955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3226962685585022},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07361340522766113},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.06102818250656128}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.3477","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.3477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/hal-00735481/PDF/RR-8074-v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.661.3381","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.661.3381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-00735481/document/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00735481v4","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00735481","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-8074, INRIA. 2012","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00735481v4","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00735481","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-8074, INRIA. 2012","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1484005810","https://openalex.org/W1980940295","https://openalex.org/W1985977780","https://openalex.org/W2028452681","https://openalex.org/W2138482845"],"related_works":["https://openalex.org/W2580714263","https://openalex.org/W3157515171","https://openalex.org/W4283696263","https://openalex.org/W1632774644","https://openalex.org/W3213199149","https://openalex.org/W2963407757","https://openalex.org/W4206237409","https://openalex.org/W2951873711","https://openalex.org/W2804916770","https://openalex.org/W1984837166"],"abstract_inverted_index":{"Let":[0],"G":[1,24],"be":[2,67,74],"a":[3,17,92,107,181],"connected":[4],"graph,":[5,119],"and":[6,18,54,129,175,184],"let":[7],"d(a,":[8],"b)":[9],"denotes":[10],"the":[11,37,41,89,110,113,118,121,131,134,137,140,159,166,170,195],"shortest":[12,122],"path":[13,123],"distance":[14,124],"between":[15],"vertices":[16,30],"b":[19],"of":[20,35,40,91,103,109,112,117,120,130,133,162,165,169,198,205],"G.":[21],"The":[22,100],"graph":[23,93],"is":[25,95,106,148],"\u03b4-hyperbolic":[26],"if":[27],"for":[28,76,87,97,202],"any":[29],"a,":[31],"b,":[32],"c,":[33],"d":[34],"G,":[36],"two":[38],"largest":[39,114],"three":[42],"sums":[43],"S1":[44],"=":[45,50,56],"d(a,b)":[46],"+":[47,52,58],"d(c,d),":[48],"S2":[49],"d(a,c)":[51],"d(b,d),":[53],"S3":[55],"d(a,d)":[57],"d(b,c)":[59],"differ":[60],"by":[61,173],"at":[62],"most":[63],"2\u03b4.":[64],"This":[65],"can":[66],"determined":[68],"in":[69,126,144,151],"time":[70,101,141,196],"O(n^4)":[71],"which":[72],"could":[73],"prohibitive":[75],"large":[77,98],"graphs.":[78,99,206],"In":[79,136],"this":[80,104,127],"document,":[81],"we":[82,191],"propose":[83,179],"an":[84,185],"exact":[85,160,200],"algorithm":[86,105,201],"determining":[88],"hyperbolicity":[90,161],"that":[94],"scalable":[96],"complexity":[102,142,197],"function":[108],"size":[111],"bi-connected":[115],"component":[116,128],"distribution":[125],"value":[132],"hyperbolicity.":[135],"worst":[138],"case,":[139],"remains":[143],"O(n^4),":[145],"but":[146],"it":[147,154],"much":[149],"faster":[150],"practice.":[152],"Indeed,":[153],"allowed":[155],"us":[156],"to":[157],"compute":[158],"all":[163],"maps":[164],"autonomous":[167],"systems":[168],"Internet":[171],"provided":[172],"CAIDA":[174],"DIMES.":[176],"We":[177],"also":[178,192],"both":[180],"multiplicative":[182],"factor":[183],"additive":[186],"constant":[187],"approximation":[188],"algorithms.":[189],"Finally,":[190],"analyze":[193],"further":[194],"our":[199],"several":[203],"class":[204]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}