| [1] |
Christofides, N., Graph Theory: An Algorithmic Approach, ((1975), Academic: Academic New York), 144 · Zbl 0321.94011 |
| [2] |
Dreyfus, S. E.; Wagner, R. A., The Steiner problem in graphs, Networks, 1, 195-207 (1972) · Zbl 0229.05125 |
| [3] |
Fitch, W., On the problem of discovering the most parsimonious tree, Amer. Nat., 111, 223 (1977) |
| [4] |
Foulds, L. R.; Hendy, M. D.; Penny, David, A graph theoretic approach to the development of minimal phylogenetic trees, J. Mol. Evol., 13, 127-149 (1979) |
| [5] |
Foulds, L. R.; Penny, David; Hendy, M. D., A general method for proving minimality of phylogenetic trees illustrated by an example with a set of 23 vertebrates, J. Mol. Evol, 13, 151-166 (1979) |
| [6] |
Foulds, L. R.; Gibbons, P. B., Solving the Steiner tree problem in graphs using branch and bound enumeration, (Proceedings of the 14th Annual Conference of the Operations Research Society of New Zealand. Proceedings of the 14th Annual Conference of the Operations Research Society of New Zealand, Christchurch, New Zealand (May 1978)), 61-69 |
| [7] |
Hakimi, S. L., Steiner’s Problem in graphs and its implications, Network, 1, 33-113 (1971) · Zbl 0229.05124 |
| [8] |
Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0797.05064 |
| [9] |
Hendy, M. D.; Penny, David; Foulds, L. R., Identification of phylogenetic trees of minimal length, J. Theoret. Biol., 71, 441-452 (1978) |
| [10] |
Kruskal, J. B., On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Amer. Math. Soc, 7, 48 (1956) · Zbl 0070.18404 |
| [11] |
Prim, R. C., Shortest connection networks and some generalizations, Bell System Tech. J., 36, 1389 (1957) |
