2304 search results - page 117 / 461 » On the Vulnerability of Large Graphs |
138
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
166
Voted
CRYPTO
2012
Springer
13 years 8 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
148
click to vote
GBRPR
2007
Springer
16 years 8 days ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
189
click to vote
ER
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
148
Voted
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...