scispace - formally typeset
Journal ArticleDOI

Approximate graph edit distance computation by means of bipartite graph matching

Kaspar Riesen, +1 more
- 01 Jun 2009 - 
- Vol. 27, Iss: 7, pp 950-959
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

Novel malware detection methods by using LCS and LCSS

TL;DR: A novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longmost Common Substring (LCS) algorithms are adopted to accurately detect malware.
Book ChapterDOI

A Survey of State of the Art Methods Employed in the Offline Signature Verification Process

TL;DR: The present chapter reviews the field of offline signature verification and presents a comprehensive overview of methods typically employed in the general process of offline signing verification.
Proceedings ArticleDOI

String Comparators Based Algorithms for Process Model Matchmaking

TL;DR: This paper proposes an approach to find relevant process models based on their decomposition into paths of possible execution sequences and proposes a schema to compute the similarity between two process models using the proposed decomposition.
Journal ArticleDOI

Graph Embedding Using Frequency Filtering

TL;DR: In this article, a novel method named Frequency Filtering Embedding (FFE) is proposed, which uses graph Fourier transform and Frequency filtering as a graph domain operator for graph feature extraction.
Posted Content

Deep Graph Similarity Learning: A Survey

TL;DR: A comprehensive review of the existing literature of deep graph similarity learning can be found in this article, where the authors propose a systematic taxonomy for the methods and applications and discuss the challenges and future directions for this problem.
References
More filters
Journal ArticleDOI

The Protein Data Bank

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)