Structural pattern recognition with graph edit distance. Approximation algorithms and applications

DOI10.1007/978-3-319-27252-8zbMath1365.68004OpenAlexW2506039404MaRDI QIDQ518686

Kaspar Riesen

Publication date: 29 March 2017

Published in: Advances in Computer Vision and Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27252-8

zbMATH Keywords

pattern recognitiongraph edit distance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distance in graphs (05C12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Node Matching Computation Between Two Large Graphs in Linear Computational Cost ⋮ Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy ⋮ Improved Graph Edit Distance Approximation with Simulated Annealing

This page was built for publication: Structural pattern recognition with graph edit distance. Approximation algorithms and applications