3757 search results - page 627 / 752 » The overlap number of a graph |
150
click to vote
PODC
2006
ACM
16 years 10 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
187
click to vote
SIGECOM
2006
ACM
16 years 9 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
167
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
176
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
170
click to vote
SAC
2005
ACM
15 years 12 months ago
2005
ACM
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...