396 search results - page 53 / 80 » Exact Algorithms for Graph Homomorphisms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
ICDM
2010
IEEE
13 years 7 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
LCPC
2009
Springer
14 years 1 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
CVPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...