Improving bipartite graph edit distance approximation using various search strategies (Q1678686)
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: Improving bipartite graph edit distance approximation using various search strategies |
scientific article; zbMATH DE number 6809009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving bipartite graph edit distance approximation using various search strategies |
scientific article; zbMATH DE number 6809009 |
Statements
Improving bipartite graph edit distance approximation using various search strategies (English)
0 references
20 November 2017
0 references
bipartite graph matching
0 references
approximate graph edit distance
0 references
0 references
