Phylogenetic k-Root and Steiner k-Root

@inproceedings{Lin2000PhylogeneticKA,
  title={Phylogenetic k-Root and Steiner k-Root},
  author={Guohui Lin and Tao Jiang and Paul E. Kearney},
  booktitle={ISAAC},
  year={2000}
}
Given a graph G = (V; E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u; v) 2 E if and only if dT (u; v) k. If the vertices in V are also allowed to be internal nodes in T , then we have the Steiner k-Root Problem. Moreover, if a particular subset S of V are required to be internal nodes in T , then we have the Restricted Steiner k-Root Problem. Phylogenetic k-roots and Steiner k-roots… CONTINUE READING
34 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Graph classes: a survey

  • A. Brandstadt, V. B. Le, J. P. Spinrad
  • SIAM Mono graphs on Discrete Mathematics and…
  • 1999
1 Excerpt

Corneil. Tree powers

  • D.G.P.E. Kearney
  • Journal of Algorithms,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…