[1] A Differentiable Approximation of the Graph Edit Distance. In Andrea Torsello and Luca Rossi editors. ,
Proceedings of SSPR'2024
,
Venice, Italy
,
September
2024
.
abstract
,
bibtex
,HAL.
[2] Comparing heuristics for graph edit distance computation. The VLDB Journal, 29: 419-458,
Jul
2020.
abstract
,
bibtex
,Springer, HAL.
[3] Improved local search for graph edit distance. Pattern Recognition Letters, 129: 19-25, 2020.
abstract
,
bibtex
,ScienceDirect, DraftVersion.
[4] GEDLIB: A C++ Library for Graph Edit Distance Computation. In Donatello Conte, Jean-Yves Ramel and Pasquale Foggia editors. ,
12th IAPR TC15 Workshop on Graph-Based Representation in Pattern Recognition (GbR)
, pages
14-24
,
Tours
,
June
2019
.
abstract
,
bibtex
,HAL, Python Binding(GIT).
[5] A structural approach to Person Re-identification problem. In
24th International Conference on Pattern Recognition (ICPR)
, pages
1616-1621
,
Pekin, China
,
Aug
2018
.
abstract
,
bibtex
,HAL, HAL(PDF).
[6] Quasimetric Graph Edit Distance As a Compact Quadratic Assignment Problem. In
Proceedings of ICPR 2018
, pages
934-939
,
Beijing, China
,
August
2018
.
abstract
,
bibtex
,HAL, HAL(PDF).
[7] Ring Based Approximation of Graph Edit Distance. In Xiao Bai, Edwin R. Hancock, Tin Kam Ho, Richard C. Wilson, Battista Biggio and Antonio Robles-Kelly editors. ,
Proceedins of Structural, Syntactic, and Statistical Pattern Recognition (SSPR)'2018
, pages
293-303
,
Beijing
,
August
2018
.
abstract
,
bibtex
,PDF(local), HAL(PDF), HAL.
[8] Approximating GED using a Stochastic Generator and Multistart IPFP. In Xiao Bai, Edwin R. Hancock, Tin Kam Ho, Richard C. Wilson, Battista Biggio and Antonio Robles-Kelly editors. ,
Proceedings of SSPR'2018
, pages
460--469
,
August
2018
.
abstract
,
bibtex
,HAL, HAL(PDF).
[9] Fast linear sum assignment with error-correction and no cost constraints. Pattern Recognition Letters, 134: 37-45, 2018.
abstract
,
bibtex
,ScienceDirect, HAL.
[10] Trends in graph-based representations for Pattern Recognition. Pattern Recognition Letters, , 2018.
abstract
,
bibtex
,url.
[11] Motifs locaux et super-graphe pour la classification de graphes symboliques avec des reseaux convolutionnels. In
Actes de la conerence RFIAP 2018
,
Marne la valee
,
Juin
2018
.
abstract
,
bibtex
,HAL.
[12] Local Patterns and Supergraph for Chemical Graph Classification with Convolutional Networks. In Xiao Bai, Edwin R. Hancock, Tin Kam Ho, Richard C. Wilson, Battista Biggio and Antonio Robles-Kelly editors. ,
Proceedins of Structural, Syntactic, and Statistical Pattern Recognition(SSPR)'2018
, pages
97--106
,
Beijing
,
August
2018
.
abstract
,
bibtex
,HAL, HAL(PDF).
[13] Approximate Graph Edit Distance by Several Local Searches in Parallel. In Ana Fred editor. ,
7th Internation Conference on Pattern Recognition Applications and Methods
,
January
2018
.
abstract
,
bibtex
,HAL.
[14] A Hungarian Algorithm for Error-Correcting Graph Matching. In Pasquale Foggia, Cheng-Lin Liu and Mario Vento editors. ,
11th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition (GbRPR 2017)
, pages
118-127
,
AnaCapri, Italy
,
May
2017
.
bibtex
,PDF(HAL), www page.
[15] Graph edit distance contest: Results and future challenges. Pattern Recognition Letters, 100(
Supplement C
): 96 - 103, 2017.
abstract
,
bibtex
,HAL, ScienceDirect.
[16] Graph edit distance as a quadratic assignment problem. Pattern Recognition Letters, 87: 38-46, 2017.
abstract
,
bibtex
,ScienceDirect, HAL.
[17]
Linear Sum Assignment with Edition
,
March
2016
.
bibtex
,HAL, PDF, arXiv.
[18] Graph Edit Distance as a Quadratic Program. In
ICPR 2016 23rd International Conference on Pattern Recognition
, pages
1701–1706
,
Cancun, Mexico
,
December
2016
.
bibtex
,HAL, PDF.
[19] Approximating Graph Edit Distance Using GNCCP. In
Structural, Syntactic, and Statistical Pattern Recognition - Joint
IAPR International Workshop, S+SSPR 2016, Merida, Mexico,
November 29 - December 2, 2016, Proceedings
, pages
496--506
,
November
2016
.
bibtex
,Springer, HAL.
[20]
A Quadratic Assignment Formulation of the Graph Edit Distance
,
Dec
2015
.
bibtex
,PDF, HAL, arXiv.
[21] Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance. In Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch and Jian Cheng editors. ,
Proceedings of the 10 th IAPR-TC15 Workshop on
Graph-based Representations (GbR) in Pattern Recognition
, pages
188-197
,
Bejing, China
,
May
2015
.
abstract
,
bibtex
,draft version (PDF), HAL.
[22] Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks. In
Structural, Syntactic, and Statistical Pattern Recognition - JointIAPR International Workshop, S+SSPR 2014. Proceedings
, pages
73--82
,
Joensuu, Finland
,
August 20-22
2014
.
bibtex
,DOI, HAL, Pdf.