Author:
Adjiashvili David,Rotbart Noy
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Disc. Math. 19(2), 448–462 (2005)
2. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, pp. 258–264 (2002)
3. Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62. IEEE (2002)
4. Bhatt, S., Chung, F.R.K., Leighton, T., Rosenberg, A.: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Disc. Math. 2(2), 145–155 (1989)
5. Lecture Notes in Computer Science;N. Bonichon,2006
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献