376 search results - page 56 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
112
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
156
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
104
Voted
TPDS
1998
15 years 1 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
113
Voted
SODA
2010
ACM
15 years 26 days ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
130
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...