95 search results - page 11 / 19 » Top-k subgraph matching query in a large graph |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...