O(n2.5) time algorithms for the subgraph homeomorphism problem on trees (Q3783601)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4047155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | O(n2.5) time algorithms for the subgraph homeomorphism problem on trees |
scientific article; zbMATH DE number 4047155 |
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
0.8511291146278381
0 references
0.8393781781196594
0 references
0.8108872771263123
0 references
0.8076903820037842
0 references
0.8068082332611084
0 references
