I also owe a debt of gratitude to my colleagues of the Intelligent Systems Group of the
Department of Computer Science and Artificial Intelligence of the University of the Basque …

Graph edit distance is an error tolerant matching technique emerged as a powerful and
flexible graph matching paradigm that can be used to address different tasks in pattern …

This paper describes an efficient algorithm for inexact graph matching. The method is purely
structural, that is, it uses only the edge or connectivity structure of the graph and does not …

This paper is concerned with computing graph edit distance. One of the criticisms that can
be leveled at existing methods for computing graph edit distance is that they lack some of …

This paper describes a new approach to matching geometric structure in 2D point-sets. The
novel feature is to unify the tasks of estimating transformation geometry and identifying point …

This book describes exciting new opportunities for utilizing robust graph representations of
data with common machine learning algorithms. Graphs can model additional information …

Although inexact graph-matching is a problem of potentially exponential complexity, the
problem may be simplified by decomposing the graphs to be matched into smaller …

In this dissertation we introduce several novel techniques for performing data mining on web
documents which utilize graph representations of document content. Graphs are more …

This paper describes a comparative study of various deterministic discrete search-strategies
for graph-matching. The framework for our study is provided by the Bayesian consistency …

This paper shows how the eigenstructure of the adjacency matrix can be used for the
purposes of robust graph matching. We commence from the observation that the leading …