Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...