default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity Issues of String to Graph Approximate Matching."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Riccardo Dondi, Giancarlo Mauri, Italo Zoppis (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-40608-0_17

access: closed

type: Conference or Workshop Paper

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/DondiMZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/DondiMZ20
Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. LATA 2020: 248-259

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.

last updated on 2020-06-15 17:05 CEST by the dblp team

all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

since 2018, dblp has been operated, funded, and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.