2304 search results - page 103 / 461 » On the Vulnerability of Large Graphs |
189
click to vote
WAW
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
197
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Image object retrieval – locating image occurrences of specific objects in large-scale image collections – is essential for manipulating the sheer amount of photos. Current s...
159
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
179
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
131
click to vote
ARSCOM
2008
15 years 6 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...