"On the Complexity of String Matching for Graphs."

Massimo Equi et al. (2023)

> Home

Details and statistics

DOI: 10.1145/3588334

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/EquiMTG23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/EquiMTG23
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi:
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19(3): 21:1-21:25 (2023)

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.