Networks are one of the most common ways to represent biological systems as complex sets
of binary interactions or relations between different bioentities. In this article, we discuss the …

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 …

Graph matching is essential in several fields that use structured information, such as biology,
chemistry, social networks, knowledge management, document analysis and others. Except …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

The subgraph isomorphism problem involves deciding if there exists a copy of a pattern
graph in a target graph. This problem may be solved by a complete tree search combined …

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 …

A solution to a binary constraint satisfaction problem is a set of discrete values, one in each
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …

Several graph-based applications require to detect and locate occurrences of a pattern
graph within a larger target graph. Subgraph isomorphism is a widely adopted formalization …

Abstract The Glasgow Subgraph Solver provides an implementation of state of the art
algorithms for subgraph isomorphism problems. It combines constraint programming …

Subgraph matching is a fundamental problem in various fields that use graph structured
data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query …