358 search results - page 72 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
WWW
2010
ACM
14 years 8 days ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
STOC
2005
ACM
13 years 10 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
ISPA
2005
Springer
13 years 10 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...