4865 search results - page 660 / 973 » The Complexity of Graph Connectivity |
159
click to vote
ASUNAM
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to jo...
153
Voted
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...
120
click to vote
ICDCS
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
144
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
150
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...