2473 search results - page 232 / 495 » The Logic of Communication Graphs |
208
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
228
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
282
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
206
click to vote
EUROSYS
2009
ACM
16 years 3 months ago
2009
ACM
Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that l...
205
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...