Author:
Bhattacharyya Bishnu,Dehne Frank
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Longest biased interval and longest nonnegative sum interval;Allison;Bioinformatics,2003
2. R. Benkoczi, B. Bhattacharya, M. Chrobak, L. Larmore, W. Rydder, Faster algorithms for k-median problems in trees, in: 28th International Symposium on Mathematical Foundations of Computer Science vol. 2747, 2003, pp. 218–227
3. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time;Cole;Algorithmica,1988
4. Finding a longest nonnegative path in a constant degree tree;Kim;Information Processing Letters,2005
5. An O(pn2) algorithm for the p-median and related problems on tree graphs;Tamir;Operations Research Letters,1996
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献