Author:
Łącki Jakub,Sankowski Piotr
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. Alstrup, S., Secher, J.P., Spork, M.: Optimal on-line decremental connectivity in trees. Inf. Process. Lett. 64(4), 161–164 (1997)
2. Eppstein, D., Galil, Z., Italiano, G.F.: Improved sparsification. Information and Computer Science. University of California, Irvine (1993)
3. Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44, 669–696 (1997)
4. Eppstein, D., Galil, Z., Italiano, G.F., Spencer, T.H.: Separator based sparsification: I. Planarity testing and minimum spanning trees. J. Comput. Syst. Sci. 52(1), 3–27 (1996)
5. Eppstein, D., Italiano, G.F., Tamassia, R., Tarjan, R.E., Westbrook, J., Yung, M.: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms 13(1), 33–54 (1992)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Multistart Alternating Tabu Search for Commercial Districting;Evolutionary Computation in Combinatorial Optimization;2018