394 search results - page 26 / 79 » Testing subgraphs in large graphs |
PVLDB
2010
13 years 7 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
SDM
2009
SIAM
14 years 6 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 ...
ARC
2007
Springer
14 years 1 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
ICOIN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
ASPDAC
2004
ACM
14 years 23 days ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...