Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modelling and Simulation
Reference75 articles.
1. Alstrup S, Holm J, Lichtenberg KD, Thorup M (2005) Maintaining information in fully dynamic trees with top trees. ACM Trans Algorithms 1:243–264
2. Alstrup S, Lauridsen PW, Sommerlund P, Thorup M (1997) Finding cores of limited length. In: Proceedings of 5th international workshop on algorithms and data structures (WADS), lecture notes in computer science, vol 1272. Springer, Berlin, pp 45–54
3. Alstrup S, Lauridsen PW, Sommerlund P, Thorup M (2001) Finding cores of limited length, IT-C Technical Report Series 2000-4, University of Copenhagen
4. Averbakh I, Berman O (1999) Algorithms for path medi-centers of a tree. Comput Oper Res 26:1395–1409
5. 4. (eds) WALCOM: algorithms and computation. WALCOM 2009. Lecture notes in computer science, vol 5431, Springer, Berlin, Heidelberg, pp 262-273
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献