Querying similar graphs in graph databases has been widely studied in graph query
processing in recent years. Existing works mainly focus on subgraph similarity search and …

The maximum common subgraph problem is to find the largest subgraph common to two
given graphs. This problem can be solved either by constraint-based search, or by reduction …

Graph matching plays an essential role in many real applications. In this paper, we study
how to match two large graphs by maximizing the number of matched edges, which is …

This paper presents our ongoing work for operators training exploiting an immersive Mixed
Reality system. Users, immersed in a Virtual Environment, can be trained in assembling or …

Algorithms for listing the subgraphs satisfying a given property (eg, being a clique, a cut, a
cycle) fall within the general framework of set systems. A set system (U,F) consists of a …

In the maximum common subgraph (MCS) problem, we are given a pair of graphs and
asked to find the largest induced subgraph common to them both. With its plethora of …

Maximum weight clique and maximum weight independent set solvers are often
benchmarked using maximum clique problem instances, with weights allocated to vertices …

Tools of molecular biology and the evolving tools of genomics can now be exploited to study
the genetic regulatory mechanisms that control cellular responses to a wide variety of …

This thesis improves the state of the art in exact, practical algorithms for finding subgraphs.
We study maximum clique, subgraph isomorphism, and maximum common subgraph …

Given two input graphs, finding the largest subgraph that occurs in both, ie, finding the
maximum common subgraph, is a fundamental operator for evaluating the similarity …