47 search results - page 6 / 10 » Inexact Graph Matching: A Case of Study |
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
PR
2007
13 years 9 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
ORDER
2006
13 years 9 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
DGCI
2009
Springer
14 years 1 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
ASWEC
2009
IEEE
14 years 4 months ago
2009
IEEE
We propose a novel methodology for analysing change propagation in software using the domain-level behavioural model of a system. We hypothesize that change propagation analysis i...