On the complexity of approximately matching a string to a directed graph (Q2084771)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of approximately matching a string to a directed graph |
scientific article |
Statements
On the complexity of approximately matching a string to a directed graph (English)
0 references
13 October 2022
0 references
