{"id":"https://openalex.org/W7109940119","doi":"https://doi.org/10.4230/lipics.sea.2025.17","title":"Computing the Exact Radius of Large Graphs","display_name":"Computing the Exact Radius of Large Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109940119","doi":"https://doi.org/10.4230/lipics.sea.2025.17"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol338-sea2025/LIPIcs.SEA.2025.17/LIPIcs.SEA.2025.17.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol338-sea2025/LIPIcs.SEA.2025.17/LIPIcs.SEA.2025.17.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Funke, Stefan","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Funke, Stefan","raw_affiliation_strings":["Universit\u00e4t Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Proissl, Claudius","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Proissl, Claudius","raw_affiliation_strings":["Universit\u00e4t Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":null,"display_name":"Storandt, Sabine","orcid":null},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Storandt, Sabine","raw_affiliation_strings":["Universit\u00e4t Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9224,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81959131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.7879999876022339,"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.7879999876022339,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07370000332593918,"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.06539999693632126,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5835000276565552},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.5152000188827515},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4912000000476837},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4311999976634979},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38920000195503235},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.38530001044273376},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.37040001153945923},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.35179999470710754},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.3303999900817871}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6075000166893005},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5835000276565552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5834000110626221},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.5152000188827515},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4912000000476837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4754999876022339},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38920000195503235},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3546999990940094},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.35179999470710754},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.31349998712539673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.31049999594688416},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30250000953674316},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.28029999136924744},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2615000009536743},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol338-sea2025/LIPIcs.SEA.2025.17/LIPIcs.SEA.2025.17.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/74604","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1swwca9g3pzhb1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MUTZEL,  Petra,  Hrsg.,  Nicola PREZZA,  Hrsg.. 23rd International Symposium on Experimental Algorithms (SEA 2025) : Proceedings. Saarbr\u00fccken: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2025, 17. Leibniz International Proceedings in Informatics (LIPIcs). 338. eISSN 1868-8969. ISBN 978-3-95977-375-1. Verf\u00fcgbar unter: doi: 10.4230/LIPIcs.SEA.2025.17","raw_type":"doc-type:Text"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol338-sea2025/LIPIcs.SEA.2025.17/LIPIcs.SEA.2025.17.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5012310743331909,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7109940119.pdf","grobid_xml":"https://content.openalex.org/works/W7109940119.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,146,210],"radius":[1,57,78,117,167,203],"of":[2,62,92,148,153,161,226],"a":[3,12,40,52,60,66,111,154,158,223],"graph":[4,38,67],"is":[5,30,58,131,138,157],"an":[6,123],"important":[7],"structural":[8],"parameter":[9],"which":[10,46,156,163],"plays":[11],"key":[13],"role":[14],"in":[15,36,82,119,127,204,218],"social":[16],"network":[17],"analysis":[18,186],"and":[19,71,76],"related":[20],"applications.":[21],"It":[22],"measures":[23],"the":[24,37,56,63,74,77,132,151,165,169,202],"minimum":[25],"shortest":[26,86],"path":[27,87],"distance":[28,53],"that":[29,98,176,188],"required":[31],"to":[32,55,104,200],"reach":[33],"all":[34,47,90],"nodes":[35,49,70,162],"from":[39,45],"single":[41],"node.":[42],"A":[43],"node":[44,171],"other":[48],"are":[50,102],"within":[51],"equal":[54],"called":[59],"center":[61,75],"graph.":[64],"In":[65,106],"with":[68,122,180],"n":[69],"m":[72],"edges,":[73],"can":[79,214],"be":[80,215],"determined":[81],"\u00d5(nm)":[83],"by":[84,140],"computing":[85],"distances":[88],"between":[89],"pairs":[91],"nodes.":[93],"Fine-grained":[94],"complexity":[95],"results":[96],"suggest":[97],"asymptotically":[99],"faster":[100],"algorithms":[101],"unlikely":[103],"exist.":[105],"this":[107],"paper,":[108],"we":[109,174],"describe":[110],"novel":[112],"randomized":[113],"algorithm":[114,142],"for":[115,143],"exact":[116],"computation":[118],"weighted":[120],"digraphs":[121],"expected":[124],"running":[125],"time":[126,206],"\u00d5(d\u00b3m)":[128],"where":[129],"d":[130,149,181],"so-called":[133],"combinatorial":[134,195],"dimension.":[135,196],"Our":[136],"methodology":[137],"inspired":[139],"Clarkson\u2019s":[141],"LP-type":[144],"problems.":[145],"value":[147],"denotes":[150],"size":[152],"basis,":[155],"smallest":[159],"subset":[160],"enforce":[164],"same":[166],"as":[168],"whole":[170],"set.":[172],"While":[173],"show":[175],"there":[177],"exist":[178],"graphs":[179,192],"\u2208":[182],"\u0398(n),":[183],"our":[184,219],"empirical":[185],"reveals":[187],"even":[189],"large":[190],"real-world":[191],"have":[193],"small":[194],"This":[197],"allows":[198],"us":[199],"compute":[201],"near-linear":[205],"on":[207,222],"such":[208],"instances.":[209],"significantly":[211],"improved":[212],"scalability":[213],"clearly":[216],"observed":[217],"experimental":[220],"evaluation":[221],"diverse":[224],"set":[225],"benchmark":[227],"graphs.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-12-08T00:00:00"}