"A local branching heuristic for solving a Graph Edit Distance Problem."

Mostafa Darwiche et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.COR.2018.02.002

access: closed

type: Journal Article

metadata version: 2021-04-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/DarwicheCRT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/DarwicheCRT19
Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt:
A local branching heuristic for solving a Graph Edit Distance Problem. Comput. Oper. Res. 106: 225-235 (2019)

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.