Triangulating 3-Colored Graphs
暂无分享,去创建一个
[1] F. McMorris,et al. When are two qualitative taxonomic characters compatible? , 1977, Journal of mathematical biology.
[2] David Sankoff,et al. COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .
[3] Fred R. McMorris,et al. Triangulating vertex colored graphs , 1994, SODA '93.
[4] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[5] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .
[6] Sampath Kannan,et al. Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[8] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..