An Application of Maximum Bipartite C-Matching to Subtree Isomorphism
Authors:
Andrzej Lingas
Affiliations:
-
Venue:
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Year:
1983
Citing
0
Cited
1
Covering a Tree by a Forest
Graph Theory, Computational Intelligence and Thought
Quantified Score
Hi-index
0.00
Visualization
Abstract