3267 search results - page 158 / 654 » Generalized quasirandom graphs |
149
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
248
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
238
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
124
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
141
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...