Author of the publication

A Local Branching Heuristic for the Graph Edit Distance Problem.

, , , and . CIARP, volume 10657 of Lecture Notes in Computer Science, page 194-202. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Contribution to Ancient Cadastral Maps Interpretation through Colour Analysis., , and . PRIS, page 89-98. INSTICC PRESS, (2007)A local evaluation of vectorized documents by means of polygon assignments and matching., , and . Int. J. Document Anal. Recognit., 15 (1): 21-43 (2012)Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?, , , , and . CoRR, (2021)On the unification of the graph edit distance and graph matching problems.. CoRR, (2021)Object Extraction from Colour Cadastral Maps., , and . Document Analysis Systems, page 506-514. IEEE Computer Society, (2008)Learning Graph Matching with a Graph-Based Perceptron in a Classification Context., , , and . GbRPR, volume 10310 of Lecture Notes in Computer Science, page 49-58. (2017)A Convolutional Neural Network into graph space., , , and . CoRR, (2020)A local branching heuristic for solving a Graph Edit Distance Problem., , , and . Comput. Oper. Res., (2019)A Segmentation Scheme Based on a Multi-graph Representation: Application to Colour Cadastral Maps., , and . GREC, volume 5046 of Lecture Notes in Computer Science, page 202-212. Springer, (2007)Model Driven Image Segmentation Using a Genetic Algorithm for Structured Data., and . HAIS (1), volume 6076 of Lecture Notes in Computer Science, page 311-318. Springer, (2010)