2304 search results - page 35 / 461 » On the Vulnerability of Large Graphs |
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
COMBINATORICS
1998
13 years 9 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
SIGMOD
2011
ACM
13 years 14 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...