2304 search results - page 269 / 461 » On the Vulnerability of Large Graphs |
170
click to vote
SIAMDM
2000
15 years 6 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
164
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
193
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
203
click to vote
DAIS
2011
14 years 10 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
223
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...