{"id":"https://openalex.org/W2034050320","doi":"https://doi.org/10.1145/1412228.1455266","title":"Fast computation of empirically tight bounds for the diameter of massive graphs","display_name":"Fast computation of empirically tight bounds for the diameter of massive graphs","publication_year":2009,"publication_date":"2009-02-01","ids":{"openalex":"https://openalex.org/W2034050320","doi":"https://doi.org/10.1145/1412228.1455266","mag":"2034050320"},"language":"en","primary_location":{"id":"doi:10.1145/1412228.1455266","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1455266","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032061401","display_name":"Cl\u00e9mence Magnien","orcid":"https://orcid.org/0000-0003-0320-4378"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cl\u00e9mence Magnien","raw_affiliation_strings":["LIP6 -- CNRS and UPMC"],"affiliations":[{"raw_affiliation_string":"LIP6 -- CNRS and UPMC","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031952531","display_name":"Matthieu Latapy","orcid":"https://orcid.org/0000-0002-0975-6109"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matthieu Latapy","raw_affiliation_strings":["LIP6 -- CNRS and UPMC"],"affiliations":[{"raw_affiliation_string":"LIP6 -- CNRS and UPMC","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022152674","display_name":"Michel Habib","orcid":"https://orcid.org/0000-0002-8564-2314"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"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":"Michel Habib","raw_affiliation_strings":["LIAFA -- CNRS and Universit\u00e9 Paris Diderot"],"affiliations":[{"raw_affiliation_string":"LIAFA -- CNRS and Universit\u00e9 Paris Diderot","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032061401"],"corresponding_institution_ids":["https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":4.3422,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.95132554,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"13","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.9995999932289124,"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.9995999932289124,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.991100013256073,"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.9876999855041504,"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/computer-science","display_name":"Computer science","score":0.5960437655448914},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5562705993652344},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5110229253768921},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5059258341789246},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49259668588638306},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4760996103286743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4711405634880066},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4324924051761627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.429311603307724},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3424074649810791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3390800654888153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5960437655448914},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5562705993652344},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5110229253768921},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5059258341789246},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49259668588638306},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4760996103286743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4711405634880066},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4324924051761627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.429311603307724},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3424074649810791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3390800654888153},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1412228.1455266","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1455266","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:CiteSeerX.psu:10.1.1.101.5280","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.5280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-rp.lip6.fr/~magnien/Publis/article.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.6884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.6884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0904.2728v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.1729","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.1729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-rp.lip6.fr/~latapy/Publis/diameter.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01146069v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01146069","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":"ACM Journal of Experimental Algorithmics, 2009, 13, pp.10. ⟨10.1145/1412228.1455266⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337392","display_name":"Division of Electrical, Communications and Cyber Systems","ror":"https://ror.org/01krpsy48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W326304601","https://openalex.org/W1568395653","https://openalex.org/W1976969221","https://openalex.org/W1989214692","https://openalex.org/W2066582699","https://openalex.org/W2070099460","https://openalex.org/W2082613046","https://openalex.org/W2091612923","https://openalex.org/W2093517369","https://openalex.org/W2096111774","https://openalex.org/W2109370679","https://openalex.org/W2111708605","https://openalex.org/W2112090702","https://openalex.org/W2113020082","https://openalex.org/W2115458940","https://openalex.org/W2117946984","https://openalex.org/W2129084394","https://openalex.org/W2142780976","https://openalex.org/W2151021662","https://openalex.org/W2155183589","https://openalex.org/W2175110005","https://openalex.org/W3089159152","https://openalex.org/W6611147970","https://openalex.org/W6682284669"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W4253593777","https://openalex.org/W2951497643","https://openalex.org/W3101625811","https://openalex.org/W2165950148","https://openalex.org/W4300101996","https://openalex.org/W2046435967","https://openalex.org/W2338854850"],"abstract_inverted_index":{"The":[0],"diameter":[1,119],"of":[2,31,89,116],"a":[3,12,19,47,61],"graph":[4],"is":[5],"among":[6],"its":[7],"most":[8],"basic":[9],"parameters.":[10],"Since":[11],"few":[13],"years":[14],"ago,":[15],"it":[16,24],"moreover":[17],"became":[18],"key":[20],"issue":[21],"to":[22,52,110],"compute":[23,72],"for":[25,77],"massive":[26],"graphs":[27],"in":[28,55,93,105,120,126],"the":[29,39,78,94,96,117],"context":[30],"complex":[32,90],"network":[33],"analysis.":[34],"However,":[35],"known":[36],"algorithms,":[37],"including":[38],"ones":[40],"producing":[41],"approximate":[42],"values,":[43],"have":[44],"too":[45],"high":[46],"time":[48],"and/or":[49],"space":[50],"complexity":[51],"be":[53],"used":[54],"such":[56],"cases.":[57],"We":[58,80],"propose":[59],"here":[60],"new":[62],"approach":[63],"relying":[64],"on":[65,84],"very":[66,100,113],"simple":[67],"and":[68,74,112],"fast":[69],"algorithms":[70],"that":[71],"(upper":[73],"lower)":[75],"bounds":[76,98],"diameter.":[79],"show":[81],"empirically":[82],"that,":[83],"various":[85],"real-world":[86],"cases":[87,121],"representative":[88],"networks":[91],"studied":[92],"literature,":[95],"obtained":[97],"are":[99],"tight":[101],"(and":[102],"even":[103],"equal":[104],"some":[106],"cases).":[107],"This":[108],"leads":[109],"rigorous":[111],"accurate":[114],"estimations":[115],"actual":[118],"which":[122],"were":[123],"previously":[124],"untractable":[125],"practice.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}