Finding approximate patterns in undirected acyclic graphs (Q5959618)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding approximate patterns in undirected acyclic graphs |
scientific article; zbMATH DE number 1720229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding approximate patterns in undirected acyclic graphs |
scientific article; zbMATH DE number 1720229 |
Statements
Finding approximate patterns in undirected acyclic graphs (English)
0 references
29 September 2002
0 references
pattern matching problem
0 references
undirected acyclic graphs
0 references
0.8123188018798828
0 references
0.8123188018798828
0 references
0.8109672665596008
0 references
0.7894676923751831
0 references
