{"id":"https://openalex.org/W3157515171","doi":"https://doi.org/10.1145/3569169","title":"Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation","display_name":"Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W3157515171","doi":"https://doi.org/10.1145/3569169","mag":"3157515171"},"language":"en","primary_location":{"id":"doi:10.1145/3569169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569169","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2104.12523","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020955386","display_name":"David Coudert","orcid":"https://orcid.org/0000-0002-3306-8314"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT","FR"],"is_corresponding":false,"raw_author_name":"David Coudert","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d\u2019Azur, Inria, CNRS, I3S France","Combinatorics, Optimization and Algorithms for Telecommunications"],"raw_orcid":"https://orcid.org/0000-0002-3306-8314","affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria, CNRS, I3S France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Combinatorics, Optimization and Algorithms for Telecommunications","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050906094","display_name":"Andr\u00e9 Nusser","orcid":"https://orcid.org/0000-0002-6349-869X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nusser","raw_affiliation_strings":["Max Planck Institute for Informatics and Graduate School of Computer Science, Saarland Informatics Campus, Saarbr\u00fccken, Germany","Max-Planck Institut f\u00fcr Informatik,"],"raw_orcid":"https://orcid.org/0000-0002-6349-869X","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics and Graduate School of Computer Science, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik,","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082075747","display_name":"Laurent Viennot","orcid":"https://orcid.org/0000-0003-3657-6979"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Viennot","raw_affiliation_strings":["Universit\u00e9 Paris Cit\u00e9, Inria, CNRS, Irif, France","[Inria de Paris]"],"raw_orcid":"https://orcid.org/0000-0003-3657-6979","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9, Inria, CNRS, Irif, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"[Inria de Paris]","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00273822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5989999771118164,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5989999771118164,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.06830000132322311,"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/T11476","display_name":"Graph theory and applications","score":0.05790000036358833,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.9434312582015991},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7820808291435242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5020003318786621},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39580702781677246},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3784985840320587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3128341734409332}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.9434312582015991},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7820808291435242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5020003318786621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39580702781677246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3784985840320587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3128341734409332}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3569169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569169","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2104.12523","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.12523","pdf_url":"https://arxiv.org/pdf/2104.12523","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03201405v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03201405","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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] Inria; I3S, Universit\u00e9 C\u00f4te d'Azur. 2021","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:HAL:hal-03837023v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03837023","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"ACM Journal of Experimental Algorithmics, 2022, 27 (1.15), pp.29. ⟨10.1145/3569169⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2104.12523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2104.12523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2104.12523","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.12523","pdf_url":"https://arxiv.org/pdf/2104.12523","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2689869783","display_name":"Idex UCA JEDI","funder_award_id":"ANR-15-IDEX-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3869568786","display_name":"Metric graph theory","funder_award_id":"ANR-17-CE40-0015","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3967094134","display_name":"Scalable routing in Multi-Modal transportation networks","funder_award_id":"ANR-17-CE22-0016","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W42296696","https://openalex.org/W127322189","https://openalex.org/W154362522","https://openalex.org/W347430236","https://openalex.org/W745517244","https://openalex.org/W1484040084","https://openalex.org/W1499093134","https://openalex.org/W1520866265","https://openalex.org/W1632774644","https://openalex.org/W1927956358","https://openalex.org/W1935074713","https://openalex.org/W1965650021","https://openalex.org/W1973894217","https://openalex.org/W1977820238","https://openalex.org/W1980940295","https://openalex.org/W1984837166","https://openalex.org/W1985977780","https://openalex.org/W1990038669","https://openalex.org/W1995725694","https://openalex.org/W2000763343","https://openalex.org/W2005945380","https://openalex.org/W2015516462","https://openalex.org/W2017848317","https://openalex.org/W2019030165","https://openalex.org/W2029182108","https://openalex.org/W2041910029","https://openalex.org/W2044124066","https://openalex.org/W2054100908","https://openalex.org/W2070017344","https://openalex.org/W2072082202","https://openalex.org/W2079919815","https://openalex.org/W2079966248","https://openalex.org/W2081231398","https://openalex.org/W2106818977","https://openalex.org/W2107940991","https://openalex.org/W2114177725","https://openalex.org/W2115857747","https://openalex.org/W2118348286","https://openalex.org/W2139484566","https://openalex.org/W2141663929","https://openalex.org/W2169504875","https://openalex.org/W2286129431","https://openalex.org/W2292059414","https://openalex.org/W2585884258","https://openalex.org/W2592698424","https://openalex.org/W2601439810","https://openalex.org/W2729780524","https://openalex.org/W2783919084","https://openalex.org/W2794549149","https://openalex.org/W2794719570","https://openalex.org/W2917858269","https://openalex.org/W2949142592","https://openalex.org/W2951040528","https://openalex.org/W2963518458","https://openalex.org/W3106522097","https://openalex.org/W4235484205","https://openalex.org/W4245608944","https://openalex.org/W4247746673","https://openalex.org/W4299291663","https://openalex.org/W6633925649","https://openalex.org/W6679248178"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W57712237","https://openalex.org/W2578985712","https://openalex.org/W4300125793","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W2952598754","https://openalex.org/W2026779193"],"abstract_inverted_index":{"Hyperbolicity":[0],"is":[1,22,74,131,136,148,294],"a":[2,14,18,57,110,118,129,137,149,205,261,295],"graph":[3,15,48,58,119,130],"parameter":[4],"that":[5,209,229,256,301],"indicates":[6],"how":[7],"much":[8],"the":[9,34,39,45,54,62,80,103,167,177,180,218,223,243,273],"shortest-path":[10,141,153],"distance":[11,181],"metric":[12],"of":[13,36,41,47,56,117,128,139,151,179,187,197,225,233,251,265,280],"deviates":[16],"from":[17],"tree":[19],"metric.":[20],"It":[21],"used":[23,163],"in":[24,84,172,214,287],"various":[25],"fields":[26],"such":[27],"as":[28,95,97],"networking,":[29],"security,":[30],"and":[31,44,79,146,216],"bioinformatics":[32],"for":[33,76,101,112,170,200,217,257,272],"classification":[35],"complex":[37],"networks,":[38],"design":[40,109],"routing":[42],"schemes,":[43],"analysis":[46],"algorithms.":[49,237],"Despite":[50],"recent":[51],"progress,":[52],"computing":[53,102,222],"hyperbolicity":[55,171,224,274],"remains":[59],"challenging.":[60],"Indeed,":[61],"best":[63],"known":[64],"algorithm":[65],"has":[66,268],"time":[67,94,169,220],"complexity":[68,88],"O(n":[69,89],"3.69":[70],")":[71,91],",":[72],"which":[73,192],"prohibitive":[75],"large":[77,227],"graphs,":[78,259],"most":[81],"efficient":[82],"algorithms":[83],"practice":[85,215],"have":[86],"space":[87,98],"2":[90],".":[92,158],"Thus,":[93],"well":[96],"are":[99],"bottlenecks":[100],"hyperbolicity.":[104],"In":[105],"this":[106,211,277],"article,":[107],"we":[108,241,254,299],"tool":[111],"enumerating":[113],"all":[114,140,152,185],"far-apart":[115,132,266,285],"pairs":[116,186,267,286],"by":[120,189,246],"decreasing":[121,190,288],"distances.":[122],"A":[123],"node":[124],"pair":[125],"(u,":[126],"v)":[127],"if":[133],"both":[134],"v":[135,157],"leaf":[138,150],"trees":[142,154],"rooted":[143,155],"at":[144,156,247],"u":[145,147],"This":[159],"notion":[160],"was":[161],"previously":[162],"to":[164,183,269,308],"drastically":[165],"reduce":[166,242],"computation":[168,178],"practice.":[173],"However,":[174],"it":[175],"required":[176],"matrix":[182],"sort":[184],"nodes":[188],"distance,":[191],"requires":[193],"an":[194],"infeasible":[195],"amount":[196],"memory":[198,212,244],"already":[199],"medium-sized":[201],"graphs.":[202],"We":[203],"present":[204],"new":[206],"data":[207],"structure":[208],"avoids":[210],"bottleneck":[213],"first":[219],"enables":[221],"several":[226],"graphs":[228],"were":[230],"far":[231],"out":[232],"reach":[234],"using":[235],"previous":[236],"For":[238],"some":[239],"instances,":[240],"consumption":[245],"least":[248],"two":[249],"orders":[250],"magnitude.":[252],"Furthermore,":[253],"show":[255],"many":[258],"only":[260],"very":[262,296],"small":[263],"fraction":[264],"be":[270,306],"considered":[271],"computation,":[275],"explaining":[276],"drastic":[278],"reduction":[279],"memory.":[281],"As":[282],"iterating":[283],"over":[284],"order":[289],"without":[290],"storing":[291],"them":[292],"explicitly":[293],"general":[297],"tool,":[298],"believe":[300],"our":[302],"approach":[303],"might":[304],"also":[305],"relevant":[307],"other":[309],"problems.":[310]},"counts_by_year":[],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}