Journal ArticleDOI
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen,Horst Bunke +1 more
Reads0
Chats0
TLDR
A novel algorithm is introduced which allows us to approximately, or suboptimally, compute edit distance in a substantially faster way and is emprically verified that the accuracy of the suboptimal distance remains sufficiently accurate for various pattern recognition applications.About:
This article is published in Image and Vision Computing.The article was published on 2009-06-01. It has received 654 citations till now. The article focuses on the topics: Graph operations & Line graph.read more
Citations
More filters
Journal ArticleDOI
A family of tractable graph metrics
José Bento,Stratis Ioannidis +1 more
TL;DR: A broad family of graph distances is defined, that includes both the chemical and the Chartrand-Kubiki-Shultz distances, and it is proved that these are all metrics that are tractable.
Book ChapterDOI
Improved Graph Edit Distance Approximation with Simulated Annealing
TL;DR: The overall aim of the present paper is to improve the distance quality of this approximation by means of a post-processing search procedure based on the idea of simulated annealing, which turns out to be particularly suitable for complex optimization problems.
Proceedings ArticleDOI
Classifying Connectivity Graphs Using Graph and Vertex Attributes
TL;DR: A novel approach to perform predictive inference on single subjects based on a lossy embedding of connectivity graphs into a vector space using graph and vertex attributes, followed by the use of statistical machine learning to build a predictive model.
Journal ArticleDOI
Anytime graph matching
TL;DR: The anytime GM can outperform suboptimal methods by only waiting for a small amount of supplementary time and brings into question the usual evidence that claims that it is impossible to use optimal GM methods in real-world applications.
Journal ArticleDOI
Error-tolerant graph matching using node contraction
TL;DR: This paper presents an approach to error-tolerant graph matching using node contraction where the given graph is transformed into another graph by contracting smaller degree nodes, which can be used as a trade-off between execution time and accuracy requirements of various graph matching applications.
References
More filters
Journal ArticleDOI
The Protein Data Bank
Helen M. Berman,John D. Westbrook,Zukang Feng,Gary L. Gilliland,Talapady N. Bhat,Helge Weissig,Ilya N. Shindyalov,Philip E. Bourne +7 more
TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Related Papers (5)
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
Kaspar Riesen,Horst Bunke +1 more
A distance measure between attributed relational graphs for pattern recognition
Alberto Sanfeliu,King-Sun Fu +1 more