Author:
Christopher George,Farach Martin,Trick Michael
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson,and M. Thorup. On the Approximability of Numerical Taxonomy — Fitting Distances by Tree Metrics. Symposium on Discrete Algorithms (SODA) '96.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
3. H-J. Bandelt, and A.W.M. Dress, A Canonical Decomposition Theory for Metrics on a Finite Set, Advances in Mathematics, 92 (1992), 47–105.
4. J-P. Barthélemy and A. Guénoche. Trees and Proximity Representations. Wiley, New York, 1991.
5. K. S. Booth, and G. S. Lueker, Testing for the Consecutive ones Property, Interval Graphs and Graph Planarity Using PQ-tree Algorithms, Journal of Computer and System Sciences, 13, (1976), 335–379.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献