"On the complexity of approximately matching a string to a directed graph."

Riccardo Dondi, Giancarlo Mauri, Italo Zoppis (2022)

> Home

Details and statistics

DOI: 10.1016/J.IC.2021.104748

access: closed

type: Journal Article

metadata version: 2022-12-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/DondiMZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/DondiMZ22
Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the complexity of approximately matching a string to a directed graph. Inf. Comput. 288: 104748 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.