In this paper, we examine the main advances registered in the last ten years in Pattern
Recognition methodologies based on graph matching and related techniques, analyzing …

Bipartite (BP) has been seen to be a fast and accurate suboptimal algorithm to solve the
Error-Tolerant Graph Matching problem. Recently, Fast Bipartite (FBP) has been presented …

Answering why-not questions in databases is promised to have wide application prospect in
many areas and thereby, has attracted recent attention in the database research community …

In pattern recognition, it is usual to compare structured objects through attributed graphs in
which nodes represent local parts and edges relations between them. Thus, each …

In this paper, we present GMG-BCU—a local search algorithm based on block coordinate
update for estimating a generalized median graph for a given collection of labeled or …

In some methodologies, it is needed a consistent common labelling between the vertices of
a graph set, for instance, to compute a representative of a set of graphs. This is an NP …

Different types of data privacy techniques have been applied to graphs and social networks.
They have been used under different assumptions on intruders' knowledge. ie, different …

Some companies use Hand-Written Electronic-Schemes or typed electronic-schemes but
without the original digital format. Some times, it would be useful to have the digitalized …

Fuzzy median graph is an important new concept that can represent a set of fuzzy graphs by
a representative fuzzy graph prototype. However, the computation of a fuzzy median graph …

The median graph has been shown to be a good choice to obtain a representative of a set of
graphs. However, its computation is a complex problem. Recently, graph embedding into …