Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching (Q3003453)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching |
scientific article |
Statements
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching (English)
0 references
27 May 2011
0 references
