Embedding and Existence Problems in Trees.
Abstract
Two kinds of problems are considered. The first problem involves the existence of certain types of subtrees in a tree. Specifically, O(p) algorithms are given to determine the maximum number of vertex-disjoint subtrees (which are isomorphic to a given star tree or line tree) of a tree. The other problem involves the existence of a tree associated with a given integer sequence. Applications are given.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1975
- Accession Number
- ADA015423
Entities
People
- A. N. Patrinos
- S. L. Hakimi
Organizations
- Northwestern University