{"id":"https://openalex.org/W2099253135","doi":"https://doi.org/10.1142/s1793830910000905","title":"COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING","display_name":"COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2099253135","doi":"https://doi.org/10.1142/s1793830910000905","mag":"2099253135"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000905","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000905","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5102716483","display_name":"Giorgio Ausiello","orcid":"https://orcid.org/0000-0003-1345-5007"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"GIORGIO AUSIELLO","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Sapienza Universit\u00e0 di Roma, via Ariosto 25, I-00185 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Sapienza Universit\u00e0 di Roma, via Ariosto 25, I-00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055684160","display_name":"Andrea Ribichini","orcid":"https://orcid.org/0000-0002-0281-4257"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ANDREA RIBICHINI","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Sapienza Universit\u00e0 di Roma, via Ariosto 25, I-00185 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Sapienza Universit\u00e0 di Roma, via Ariosto 25, I-00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045218419","display_name":"Paolo Giulio Franciosa","orcid":"https://orcid.org/0000-0002-5464-4069"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"PAOLO G. FRANCIOSA","raw_affiliation_strings":["Dipartimento di Scienze Statistiche, Sapienza Universit\u00e0 di Roma, piazzale Aldo Moro 5, I-00185 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze Statistiche, Sapienza Universit\u00e0 di Roma, piazzale Aldo Moro 5, I-00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"GIUSEPPE F. ITALIANO","raw_affiliation_strings":["Dipartimento di Informatica, Sistemi e Produzione, Universit\u00e0 di Roma \"Tor Vergata\", via del Politecnico 1, 00133 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Sistemi e Produzione, Universit\u00e0 di Roma \"Tor Vergata\", via del Politecnico 1, 00133 Roma, Italy","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102716483"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.6691,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.71858791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"02","issue":"04","first_page":"591","last_page":"605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/spanner","display_name":"Spanner","score":0.9315780401229858},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6377938389778137},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5864999294281006},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5442185997962952},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5217907428741455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5151618719100952},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5056915283203125},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.45958250761032104},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4150530695915222},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.37884747982025146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34233081340789795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32885289192199707},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.09410181641578674}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9315780401229858},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6377938389778137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5864999294281006},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5442185997962952},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5217907428741455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5151618719100952},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5056915283203125},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.45958250761032104},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4150530695915222},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37884747982025146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34233081340789795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32885289192199707},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.09410181641578674},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s1793830910000905","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000905","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/11817","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/11817","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.luiss.it:11385/199799","is_oa":false,"landing_page_url":"http://hdl.handle.net/11385/199799","pdf_url":null,"source":{"id":"https://openalex.org/S4377196446","display_name":"IRIS - Institutional Research Information System (Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56441308","host_organization_name":"Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli","host_organization_lineage":["https://openalex.org/I56441308"],"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"},{"id":"pmh:oai:iris.uniroma1.it:11573/427729","is_oa":false,"landing_page_url":"http://www.worldscinet.com/dmaa/02/0204/S17938309100204.html","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1966206200","https://openalex.org/W1968301997","https://openalex.org/W1983266860","https://openalex.org/W2021932455","https://openalex.org/W2023706097","https://openalex.org/W2046441184","https://openalex.org/W2056518357","https://openalex.org/W2067528822","https://openalex.org/W2069409708","https://openalex.org/W2097747425","https://openalex.org/W2113581856","https://openalex.org/W4231761369","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W1668215238","https://openalex.org/W2122632420","https://openalex.org/W2993304180","https://openalex.org/W4287999588","https://openalex.org/W3082881870","https://openalex.org/W2044334960","https://openalex.org/W2062550101","https://openalex.org/W1620133714","https://openalex.org/W2099253135","https://openalex.org/W2078237332"],"abstract_inverted_index":{"Let":[0],"G":[1,15,89,141],"be":[2,105,122,226],"an":[3,145],"undirected":[4],"graph":[5,140],"with":[6,90],"m":[7,165],"edges":[8,102,119],"and":[9,64,86,103,120,157,166,176,187,200,221],"n":[10,99],"vertices.":[11,27,49],"A":[12],"spanner":[13,31],"of":[14,26,42,45,52,88,148,179,204],"is":[16,32,55,142,211],"a":[17,33],"subgraph":[18,34],"which":[19,35,150],"preserves":[20,36],"approximate":[21,37],"distances":[22],"between":[23],"all":[24],"pairs":[25],"An":[28],"f-vertex":[29,83,217],"fault-tolerant":[30,62,84,218],"distances,":[38],"under":[39],"the":[40,91,139,201,230],"failure":[41],"any":[43,154],"set":[44],"at":[46],"most":[47],"f":[48],"The":[50],"contribution":[51],"this":[53],"paper":[54],"twofold:":[56],"we":[57,78,159],"present":[58],"algorithms":[59,67,80,130,206],"for":[60,68,81,207],"computing":[61,69,82,208],"spanners,":[63],"propose":[65],"streaming":[66],"spanners":[70,195,210],"in":[71,107,124,153,163,229],"very":[72,183],"small":[73,184],"internal":[74,185],"memory.":[75],"In":[76],"particular,":[77],"give":[79],"(3,2)-":[85],"(2,1)-spanners":[87],"following":[92],"bounds:":[93],"our":[94,205],"(3,2)-spanner":[95],"contains":[96,115],"O(f":[97],"4/3":[98,100],")":[101,118],"can":[104,121,224],"computed":[106,123,227],"time":[108,125],"\u00d5(f":[109],"2":[110],"m),":[111],"while":[112],"our(2,":[113],"1)-spanner":[114],"O(fn":[116],"3/2":[117],"[Formula:":[126],"see":[127],"text].":[128],"Both":[129],"improve":[131],"significantly":[132],"on":[133],"previously":[134],"known":[135],"bounds.":[136],"Assume":[137],"that":[138,158],"presented":[143],"as":[144,188],"input":[146],"stream":[147],"edges,":[149],"may":[151],"appear":[152],"arbitrary":[155],"order,":[156],"do":[160],"not":[161],"know":[162],"advance":[164],"n.":[167],"We":[168],"show":[169],"how":[170],"to":[171],"compute":[172],"efficiently":[173,228],"(3,":[174,219],"2)-":[175,220],"(2,":[177,222],"1)-spanners":[178,223],"G,":[180],"using":[181],"only":[182],"memory":[186,192],"low":[189],"access":[190],"external":[191],"device.":[193],"Our":[194,216],"have":[196],"asymptotically":[197],"optimal":[198,212],"size":[199],"I/O":[202],"complexity":[203],"such":[209],"upto":[213],"apolylogarithmic":[214],"factor.":[215],"also":[225],"same":[231],"computational":[232],"model":[233],"described":[234],"above.":[235]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}