Bosonic quantum devices offer a novel approach to realize quantum computations, where
the quantum two-level system (qubit) is replaced with the quantum (an) harmonic oscillator …

Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …

We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

Ongoing advances in force field and computer hardware development enable the use of
molecular dynamics (MD) to simulate increasingly complex systems with the ultimate goal of …

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

Subgraph query processing (also known as subgraph search) and subgraph matching are
fundamental graph problems in many application domains. A lot of efforts have been made …

This paper presents a largely improved version of the VF2 algorithm for the Subgraph
Isomorphism Problem. The improvements are twofold. Firstly, it is based on a new approach …

Subgraph counting, as a fundamental problem in network analysis, is to count the number of
subgraphs in a data graph that match a given query graph by either homomorphism or …

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

Continuous subgraph matching (CSM) is an important building block in many real-time
graph processing applications. Given a subgraph query Q and a data graph stream, a CSM …