Andreas Fischer, Réjean Plamondon
, Yvon Savaria, Kaspar Riesen and Horst Bunke
Paper (2014)
An external link is available for this item
| Department: | Department of Electrical Engineering |
|---|---|
| Research Center: | GR2M - Microelectronics and Microsystems Research Group |
| PolyPublie URL: | https://publications.polymtl.ca/12376/ |
| Conference Title: | Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR 2014) |
| Conference Location: | Joensuu, Finland |
| Conference Date(s): | 2014-08-20 - 2014-08-22 |
| Publisher: | Springer |
| DOI: | 10.1007/978-3-662-44415-3_9 |
| Official URL: | https://doi.org/10.1007/978-3-662-44415-3_9 |
| Date Deposited: | 18 Apr 2023 15:08 |
| Last Modified: | 25 Sep 2024 15:49 |
| Cite in APA 7: | Fischer, A., Plamondon, R., Savaria, Y., Riesen, K., & Bunke, H. (2014, August). A Hausdorff heuristic for efficient computation of graph edit distance [Paper]. Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR 2014), Joensuu, Finland. https://doi.org/10.1007/978-3-662-44415-3_9 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
