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
Fast Similarity Search for Graphs by Edit Distance
TL;DR: Algorithms based on the filter-and-refine strategy using inverted indexing are mainly presented for fast similarity search for objects represented by trees and graphs.
Posted Content
Graph edit distance : a new binary linear programming formulation
TL;DR: This paper provides a guide that can be used to choose the appropriate method for computing the exact GED between two graphs by considering both the quality of the proposed solution and the eciency of the algorithms as performance criteria.
Book ChapterDOI
Approximating Graph Edit Distance using GNCCP
TL;DR: This paper adapts a convex concave regularization scheme initially designed for graph matching which allows to reach better local minimum and avoids the need of an initialization step, and outperforms previous methods in terms of accuracy.
Dissertation
Mise en correspondance de données textuelles hétérogènes fondée sur la dimension spatiale
TL;DR: Dans la premiere phase, nous proposons de representer la dimension spatiale de chaque document d'un corpus a travers une structure dediee, the Spatial Textual Representation (STR), a l'aide of deux concepts : l'entite thematique et de the relation thematiques.
Book ChapterDOI
Graph characterization via backtrackless paths
TL;DR: Backtrackless paths are used for gauging the similarity between graphs and efficient algorithms for characterizing both labeled and unlabeled graphs are introduced.
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