Finding smallest supertrees under minor containment

International Journal of Foundations of Computer Science

Volumn 11, Issue 3, 2000, Pages 445-465

  Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Algorithms; Minor Containment; Supertrees

Indexed keywords

EID: 18444378210     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000259     Document Type: Article

References (19)

1. A. Amir and D. Keseknan. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM Journal on Computing, 26(6): 1656-1669, December 1997.
2. J. A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1976.
3. M. J. Chung. 0(n25) time algorithms for the subgraph homeomorphism problem on trees. Journal of Algorithms, 8:106-112, 1987.
4. R. Cole and R. Hariharan. An 0(n log n) algorithm for the maximum agreement subtree problem for binary trees. In Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, pages 323-332, 1996.
5. M. Dubiner, Z. Galil, and E. Magen. Faster tree pattern matching. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 145-150, 1990.
6. P. Duchet. Tree minors. Presentation at AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, 1991 (personal communication, A. Gupta).
7. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55(6):297-301, 1995.
8. M. Farach and M. Thorup. Fast comparison of evolutionary trees. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481-488, 1994.
9. A. Gupta and N. Nishimura. The parallel complexity of tree embedding problems. Journal of Algorithms, 18(1): 176-200, 1995.
10. A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21:183-210, 1998.
11. A. Gupta, N. Nishimura, A. Proskurowski, and P. Ragde. Embeddings of kconnected graphs of pathwidth k. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, 2000.
12. T. Jiang, L. Wang, and K. Zhang. Alignment of trees -an alternative to tree edit. In Combinatorial Pattern Matching, pages 75-86, 1994.
13. P. Kilpelainen and H. Mannila. Ordered and unordered tree inclusion. SIAM Journal on Computing, 24(2):340-356, 1995.
14. S. R. Kosaraju. Efficient tree pattern matching. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 178-183, 1989.
15. J. Lagergren. The size of an intertwine. In Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science, pages 520-531, 1994.
16. J. Matousek and R. Thomas. On the complexity of finding iso-and other morphisms for partial fc-trees. Discrete Mathematics, 108:343-364, 1992.
17. N. Robertson and P. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
18. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. International Journal of Computer Vision, to appear.
19. T. Warnow. Tree compatibility and inferring evolutionary history. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 382-391, 1993.