2304 search results - page 167 / 461 » On the Vulnerability of Large Graphs |
173
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
161
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
195
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
148
click to vote
ACNS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Network coding has been shown to improve the capacity and robustness in networks. However, since intermediate nodes modify packets en-route, integrity of data cannot be c...
180
click to vote
CCS
2007
ACM
16 years 21 days ago
2007
ACM
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...