O(n2.5) time algorithms for the subgraph homeomorphism problem on trees (Q3783601)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(n2.5) time algorithms for the subgraph homeomorphism problem on trees |
scientific article |
Statements
O(n2.5) time algorithms for the subgraph homeomorphism problem on trees (English)
0 references
1987
0 references
subgraph homeomorphism problem
0 references
subtree isomorphism problem
0 references
unrooted trees
0 references
