Author:
Auletta Vincenzo,Parente Domenico,Persiano Giuseppe
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Sparsification — a technique for speeding up dynamic graph algorithms;Eppstein,1992
2. Separator based sparsification for dynamic planar graph algorithms;Eppstein,1993
3. G.N. Frederickson, Parametric search and locating supply center in trees, in: Proc. 2nd Workshop on Algorithms and Data Structures, Vol. 519 of Lecture Notes in Computer Science (Springer, Berlin) 299–319.
4. Data structures for on-line updating of minimum spanning trees;Frederickson;SIAM J. Comput.,1985
5. Ambivalent data structure for dynamic 2-edge-connectivity and k smallest spanning trees;Frederickson,1991
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献