112 search results - page 3 / 23 » Neighborhood based fast graph search in large networks |
ICDE
2010
IEEE
13 years 10 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
CIKM
2009
Springer
14 years 22 days ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
DASFAA
2010
IEEE
13 years 7 months ago
2010
IEEE
An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-topeer network. In this paper, we propose a large scale key-v...
BIBM
2009
IEEE
14 years 29 days ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...