"A generalization of the most common subgraph distance and its application ..."

Michael Hecht (2017)

> Home

Details and statistics

DOI: 10.1016/J.PATREC.2016.09.008

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/prl/Hecht17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/prl/Hecht17
Michael Hecht:
A generalization of the most common subgraph distance and its application to graph editing. Pattern Recognit. Lett. 87: 71-78 (2017)

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.