( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sparsification -- a Technique for Speeding Up Dynamic Graph Algorithms

, , , и . J. ACM, 44 (5): 669--696 (сентября 1997)
DOI: 10.1145/265910.265914

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Giuseppe F Vercellino

Giuseppe F Miozzari

Giuseppe Veltri

Giuseppe Olivato

Giuseppe Amato

 

Другие публикации лиц с тем же именем

Personal data disclosure and data breaches: the customer's viewpoint, , и . CoRR, (2012)On Robust Graph Spanners, , , и . CoRR, (2013)All-Pairs $2$-reachability in Õ(nω) Time., , , , и . CoRR, (2016)Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study., , , , и . ALENEX, стр. 169-183. SIAM, (2018)A new approach to dynamic all pairs shortest paths., и . STOC, стр. 159-166. ACM, (2003)Sorting and searching in the presence of memory faults (without redundancy)., и . STOC, стр. 101-110. ACM, (2004)Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)., и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 605-615. Springer, (1997)Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments., , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 605-617. Springer, (2007)The Price of Resiliency: A Case Study on Sorting with Memory Faults., , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 768-779. Springer, (2006)Dynamically Switching Vertices in Planar Graphs (Extended Abstract)., и . ESA, том 1284 из Lecture Notes in Computer Science, стр. 186-199. Springer, (1997)