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
Proceedings ArticleDOI
NetLSD: Hearing the Shape of a Graph
TL;DR: This paper proposes the Network Laplacian Spectral Descriptor (NetLSD), the first, to the knowledge, permutation- and size-invariant, scale-adaptive, and efficiently computable graph representation method that allows for straightforward comparisons of large graphs.
Journal ArticleDOI
Approximation of graph edit distance based on Hausdorff matching
TL;DR: A quadratic time approximation of graph edit distance based on Hausdorff matching is proposed and shows a promising potential in terms of flexibility, efficiency, and accuracy.
Journal ArticleDOI
A long trip in the charming world of graphs for Pattern Recognition
TL;DR: This paper is a historical overview of graph-based methodologies in Pattern Recognition in the last 40 years; history is interpreted with the aim of recognizing the rationale inspiring the papers published in these years, so as to roughly classify them.
Book ChapterDOI
Speeding up graph edit distance computation through fast bipartite matching
TL;DR: This paper proposes a novel approach for the efficient computation of graph edit distance based on bipartite graph matching by means of the Volgenant-Jonker assignment algorithm, which provides only suboptimal edit distances, but runs in polynomial time.
Journal ArticleDOI
Graph embedding in vector spaces by node attribute statistics
TL;DR: This work proposes a novel embedding methodology for graphs with continuous node attributes and unattributed edges based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives.
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