2304 search results - page 308 / 461 » On the Vulnerability of Large Graphs |
121
click to vote
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
104
click to vote
SIGCOMM
2009
ACM
15 years 7 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
104
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
105
Voted
GD
2007
Springer
15 years 7 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
HM
2007
Springer
15 years 7 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...