Unordered tree contraction
The tree contraction problem is for reducing a rooted tree to its root by a sequence of independent vertex removals. All of the previous research works are concentrated on ordered rooted tree whereas in this paper we are going to discuss the case of unordered rooted tree.
Unable to display preview. Download preview PDF.
- 6.L. H. Hsu and S. Y. Wang, Maximum independent number for series-parallel networks, to appear at Networks.Google Scholar
- 7.L. H. Hsu and S. Y. Wang, Maximum matching for series-parallel networks, submitted to Discrete Applied Math.Google Scholar
- 8.L. H. Hsu, Y. C. Chang and T. Y. Ho, Double Euler trail on series-parallel networks, submitted to Discrete Applied Math.Google Scholar
- 10.G. L. Miller and J. H. Reif, Parallel tree contraction and its application, in "26th IEEE Symp. on Foundations of Comput. Sci., 1985," 478–489.Google Scholar