Author:
Berry Vincent,Guillemot Sylvain,Nicolas François,Paul Christophe
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
2. Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithm. SIAM J. on Comput. 26(6), 1656–1669 (1997)
3. Lecture Notes in Computer Science;V. Berry,2004
4. Berry, V., Nicolas, F.: Improved parametrized complexity of maximum agreement subtree and maximum compatible tree problems. IEEE Trans. on Comput. Biology and Bioinf. (to appear)
5. Bonizzoni, P., Della Vedova, G., Mauri, G.: Approximating the maximum isomorphic agreement subtree is hard. Int. J. of Found. of Comput. Sci. 11(4), 579–590 (2000)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the star forest polytope for trees and cycles;RAIRO - Operations Research;2019-10-09
2. Maximum Compatible Tree;Encyclopedia of Algorithms;2016
3. The maximum weight spanning star forest problem on cactus graphs;Discrete Mathematics, Algorithms and Applications;2015-05-25
4. Maximum Compatible Tree;Encyclopedia of Algorithms;2015
5. APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM;International Journal of Foundations of Computer Science;2012-11