2304 search results - page 61 / 461 » On the Vulnerability of Large Graphs |
114
click to vote
TCS
2011
14 years 6 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
106
click to vote
SIGCOMM
2006
ACM
15 years 5 months ago
2006
ACM
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...
SIGMETRICS
2005
ACM
15 years 5 months ago
2005
ACM
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
AAAI
2007
15 years 2 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
106
click to vote
APVIS
2007
15 years 1 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...