{"id":"https://openalex.org/W4307927181","doi":"https://doi.org/10.1145/3569168","title":"On Computing the Diameter of (Weighted) Link Streams","display_name":"On Computing the Diameter of (Weighted) Link Streams","publication_year":2022,"publication_date":"2022-10-28","ids":{"openalex":"https://openalex.org/W4307927181","doi":"https://doi.org/10.1145/3569168"},"language":"en","primary_location":{"id":"doi:10.1145/3569168","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569168","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/A5028573984","display_name":"M Calamai","orcid":"https://orcid.org/0000-0003-4399-5530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco Calamai","raw_affiliation_strings":["Dipartimento di Statistica, Informatica, Applicazioni, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4399-5530","affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Informatica, Applicazioni, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012362492","display_name":"Pierluigi Crescenzi","orcid":"https://orcid.org/0000-0001-8789-3195"},"institutions":[{"id":"https://openalex.org/I4210150763","display_name":"Gran Sasso Science Institute","ror":"https://ror.org/043qcb444","country_code":"IT","type":"education","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210150763"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pierluigi Crescenzi","raw_affiliation_strings":["Gran Sasso Science Institute, L\u2019Aquila, Italy","Gran Sasso Science Institute, L'Aquila, Italy"],"raw_orcid":"https://orcid.org/0000-0001-8789-3195","affiliations":[{"raw_affiliation_string":"Gran Sasso Science Institute, L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I4210150763"]},{"raw_affiliation_string":"Gran Sasso Science Institute, L'Aquila, Italy","institution_ids":["https://openalex.org/I4210150763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035852380","display_name":"Andrea Marino","orcid":"https://orcid.org/0000-0002-9854-7885"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Marino","raw_affiliation_strings":["Dipartimento di Statistica, Informatica, Applicazioni, Italy"],"raw_orcid":"https://orcid.org/0000-0002-9854-7885","affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Informatica, Applicazioni, Italy","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9898,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74370266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/heuristics","display_name":"Heuristics","score":0.5636789202690125},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.557805061340332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5239834189414978},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5125827193260193},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.5054221153259277},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49692800641059875},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49324220418930054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45589354634284973},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45515507459640503},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4338446855545044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4163036644458771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4051411747932434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3302503228187561},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2139747142791748},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0788954496383667}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5636789202690125},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.557805061340332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5239834189414978},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5125827193260193},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5054221153259277},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49692800641059875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49324220418930054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45589354634284973},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45515507459640503},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4338446855545044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4163036644458771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4051411747932434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3302503228187561},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2139747142791748},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0788954496383667},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3569168","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3569168","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:flore.unifi.it:2158/1309542","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1309542","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W94873848","https://openalex.org/W127322189","https://openalex.org/W1499093134","https://openalex.org/W1984196269","https://openalex.org/W1995725694","https://openalex.org/W2022322548","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2044124066","https://openalex.org/W2049706966","https://openalex.org/W2070017344","https://openalex.org/W2137560895","https://openalex.org/W2143813994","https://openalex.org/W2147107544","https://openalex.org/W2244843312","https://openalex.org/W2498592833","https://openalex.org/W2804087515","https://openalex.org/W2951155941","https://openalex.org/W2964196611","https://openalex.org/W2979617875","https://openalex.org/W3082831818","https://openalex.org/W3119793544","https://openalex.org/W3157160562"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W324626582","https://openalex.org/W4389302559","https://openalex.org/W2170725231"],"abstract_inverted_index":{"A":[0],"weighted":[1,133,321],"link":[2,134,288,322],"stream":[3,135],"is":[4,38,48,177,226,314],"a":[5,190,195,199,202,259,305,312],"pair":[6,185],"(":[7,25],"V":[8,12,35],",":[9,13,28,36],"\ud835\udd3c)":[10],"comprising":[11],"the":[14,20,39,43,68,98,109,114,127,140,143,146,152,158,165,178,182,209,221,245,251,254,273,295,299,309,318],"set":[15,183,215,283],"of":[16,22,42,55,60,86,100,116,129,139,145,151,160,184,186,211,216,220,223,263,275,280,284,298,311,320],"nodes,":[17],"and":[18,46,79,150,228,231,236],"\ud835\udd3c,":[19],"list":[21],"temporal":[23,44,101,168,296],"edges":[24],"u,v,t":[26],",\u03bb)":[27],"where":[29],"u,v":[30],"are":[31],"two":[32],"nodes":[33,187],"in":[34,92,123,173,218,317],"t":[37],"starting":[40],"time":[41,93,148,154,204],"edge,":[45],"\u03bb":[47],"its":[49],"travel":[50],"time.":[51,81],"By":[52],"making":[53],"use":[54],"this":[56],"model,":[57],"different":[58,105],"notions":[59],"diameter":[61,115,128,179,252,310],"can":[62],"be":[63,90,171],"defined,":[64],"which":[65],"refer":[66],"to":[67,97,121,162,181],"following":[69],"distances:":[70],"earliest":[71],"arrival":[72],"time,":[73,76,78],"latest":[74],"departure":[75],"fastest":[77,147],"shortest":[80,153],"After":[82],"proving":[83],"that":[84,118,167,192,208,294],"any":[85],"these":[87],"diameters":[88],"cannot":[89,170],"computed":[91],"sub-quadratic":[94],"with":[95,164],"respect":[96],"number":[99,222,262],"edges,":[102],"we":[103,156,229],"propose":[104,230],"algorithms":[106,247],"(inspired":[107],"by":[108,189,278,324],"approach":[110],"used":[111],"for":[112,136,239,303],"computing":[113,240,249,304],"graphs)":[117],"allow":[119],"us":[120],"compute,":[122],"practice":[124],"very":[125,257,260,326],"efficiently,":[126],"quite":[130,315],"large":[131],"real-world":[132,287],"several":[137,234],"definitions":[138],"diameter.":[141],"In":[142],"case":[144,319],"distance":[149],"distance,":[155],"introduce":[157],"notion":[159],"pivot-diameter,":[161],"deal":[163],"fact":[166],"paths":[169],"concatenated":[172],"general.":[174],"The":[175],"pivot-diameter":[176],"restricted":[180],"connected":[188],"path":[191,269],"passes":[193],"through":[194],"pivot":[196,242],"(that":[197],"is,":[198],"node":[200],"at":[201],"given":[203],"instant).":[205],"We":[206,271,290],"prove":[207,293],"problem":[210],"finding":[212],"an":[213,281],"optimal":[214],"pivots,":[217],"terms":[219],"pairs":[224],"connected,":[225],"NP-hard,":[227],"experimentally":[232,292],"evaluate":[233],"simple":[235],"fast":[237],"heuristics":[238],"\u201cgood\u201d":[241],"sets.":[243],"All":[244],"proposed":[246],"(for":[248],"either":[250],"or":[253],"pivot-diameter)":[255],"require":[256],"often":[258,327],"low":[261],"single":[264],"source":[265],"(or":[266],"target)":[267],"best":[268],"computations.":[270],"verify":[272],"effectiveness":[274],"our":[276],"approaches":[277],"means":[279],"extensive":[282],"experiments":[285],"on":[286,308],"streams.":[289],"also":[291],"version":[297],"well-known":[300],"2-sweep":[301],"technique,":[302],"lower":[306],"bound":[307],"graph,":[313],"effective":[316],"stream,":[323],"returning":[325],"tight":[328],"bounds.":[329]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2022-11-06T00:00:00"}