Name
Abstract | ||
|---|---|---|
•We propose an efficient procedure for solving the linear sum assignment problem with error-correction.•In contrast to most efficient competitors, our procedure does not impose constraints on the costs.•Our procedure is more stable than existing competitors.•Our procedure can be implemented more easily than existing competitors. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.patrec.2018.03.032 | Pattern Recognition Letters |
Keywords | DocType | Volume |
Inexact graph matching,Linear assignment,Graph edit distance | Journal | 134 |
ISSN | Citations | PageRank |
0167-8655 | 3 | 0.42 |
References | Authors | |
20 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sébastien Bougleux | 1 | 395 | 27.05 |
| Benoit Gaüzère | 2 | 5 | 1.13 |
| David Blumenthal | 3 | 24 | 6.26 |
| Luc Brun | 4 | 53 | 5.23 |