Abstract
The problem of determining the maximum number of node-disjoint subtrees of a tree T on n t nodes isomorphic to a tree S on n s nodes is shown to be solvable in time O(n 3/2s nt). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.KeywordsBipartite GraphMatch ProblemMaximum MatchSubgraph IsomorphismRoot EdgeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
