3204 search results - page 461 / 641 » The Alcuin Number of a Graph |
197
click to vote
PODC
2005
ACM
16 years 18 days 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...
184
click to vote
SAC
2005
ACM
16 years 18 days 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...
214
click to vote
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
208
click to vote
STOC
2004
ACM
16 years 13 days ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
232
click to vote
FSTTCS
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...