A local branching heuristic for solving a graph edit distance problem (Q1734846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A local branching heuristic for solving a graph edit distance problem |
scientific article; zbMATH DE number 7043535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local branching heuristic for solving a graph edit distance problem |
scientific article; zbMATH DE number 7043535 |
Statements
A local branching heuristic for solving a graph edit distance problem (English)
0 references
27 March 2019
0 references
graph edit distance
0 references
graph matching
0 references
local branching heuristic
0 references
0.87837905
0 references
0 references
0.87728417
0 references
0 references
0.8670554
0 references
0.86361146
0 references
