On the complexity of approximately matching a string to a directed graph (Q2084771)
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: On the complexity of approximately matching a string to a directed graph |
scientific article; zbMATH DE number 7601278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of approximately matching a string to a directed graph |
scientific article; zbMATH DE number 7601278 |
Statements
On the complexity of approximately matching a string to a directed graph (English)
0 references
13 October 2022
0 references
