{"id":"https://openalex.org/W7160231459","doi":"https://doi.org/10.48550/arxiv.2605.01578","title":"A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs","display_name":"A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs","publication_year":2026,"publication_date":"2026-05-02","ids":{"openalex":"https://openalex.org/W7160231459","doi":"https://doi.org/10.48550/arxiv.2605.01578"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05611825v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05611825","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"University of Bucharest, Faculty of Mathematics and Computer Science; National Institute of Research and Development in Informatics (ICI Bucuresti). 2026","raw_type":"info:eu-repo/semantics/report"},"type":"report","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.01578","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ducoffe, Guillaume","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5020003818"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2948000133037567,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2948000133037567,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.1728000044822693,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10304","display_name":"Geometric and Algebraic Topology","score":0.10249999910593033,"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/vertex","display_name":"Vertex (graph theory)","score":0.5631999969482422},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5045999884605408},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.47920000553131104},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.42239999771118164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3882000148296356},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.35249999165534973},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.31619998812675476},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.2955000102519989}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.738099992275238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7250000238418579},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5631999969482422},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.47920000553131104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4544000029563904},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.42239999771118164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3882000148296356},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.35249999165534973},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.31619998812675476},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2955000102519989},{"id":"https://openalex.org/C82190004","wikidata":"https://www.wikidata.org/wiki/Q5121633","display_name":"Circulant graph","level":5,"score":0.29179999232292175},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28139999508857727},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.27619999647140503},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.2689000070095062},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.25949999690055847},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2547000050544739},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2526000142097473}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05611825v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05611825","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"University of Bucharest, Faculty of Mathematics and Computer Science; National Institute of Research and Development in Informatics (ICI Bucuresti). 2026","raw_type":"info:eu-repo/semantics/report"},{"id":"doi:10.48550/arxiv.2605.01578","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01578","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.01578","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01578","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"vertex":[1,31,115,139,179],"in":[2,94,168,180],"a":[3,21,29,51,74,83,86,104,132,137,172,177],"graph":[4,22,75,111],"is":[5,24,38,81,103,140,171],"called":[6],"central":[7,30,52,138,178],"if":[8],"it":[9,37,80],"minimizes":[10],"its":[11,147],"maximum":[12],"distance":[13,27,117],"to":[14,49,82,123],"the":[15,25,33,43,56,60,70,95,124,156,169,181,192,202,210],"other":[16,34,125],"vertices.":[17],"The":[18],"radius":[19],"of":[20,59,73,89,97,160,183,194],"$G$":[23,112],"largest":[26],"between":[28],"and":[32,36],"vertices,":[35],"denoted":[39],"by":[40],"$rad(G)$.":[41],"In":[42,100],"center":[44,61],"problem,":[45],"we":[46,189],"are":[47],"asked":[48],"find":[50],"vertex.":[53],"We":[54],"study":[55],"fine-grained":[57],"complexity":[58],"problem":[62],"on":[63],"graphs":[64,154],"with":[65],"small":[66],"Gromov":[67,71],"hyperbolicity.":[68],"Roughly,":[69],"hyperbolicity":[72],"represents":[76],"how":[77],"close,":[78],"locally,":[79],"tree,":[84],"from":[85],"metric":[87],"point":[88],"view.":[90],"It":[91],"has":[92],"applications":[93],"design":[96],"approximation":[98],"algorithms.":[99],"particular,":[101],"there":[102],"linear-time":[105,133,173],"algorithm":[106,134,174,197],"that":[107],"for":[108,135,143,152,175,198],"every":[109],"$\u03b4$-hyperbolic":[110],"outputs":[113],"some":[114],"at":[116,118],"most":[119],"$rad(G)":[120],"+":[121],"5\u03b4$":[122],"vertices":[126],"[Chepoi":[127],"et":[128,162],"al,":[129,163],"SoCG'08].":[130],"However,":[131],"computing":[136,176],"known":[141],"only":[142],"$0$-hyperbolic":[144],"graphs,":[145,200],"whereas":[146],"existence":[148,193],"was":[149],"ruled":[150],"out":[151,191],"$2$-hyperbolic":[153],"under":[155,201],"Hitting":[157,203],"Set":[158,204],"Conjecture":[159],"[Abboud":[161],"SODA'16].":[164],"Our":[165],"main":[166],"contribution":[167],"paper":[170],"class":[182],"$\\frac":[184],"1":[185],"2$-hyperbolic":[186],"graphs.":[187],"Furthermore,":[188],"rule":[190],"such":[195],"an":[196],"$1$-hyperbolic":[199],"Conjecture,":[205],"thus":[206],"completely":[207],"settling":[208],"all":[209],"cases":[211],"left":[212],"open.":[213]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-05-06T00:00:00"}