Sciweavers

3052 search results - page 4 / 611
» Weakly Distributive Domains
Sort
View
47
Voted
PODC
2005
ACM
15 years 4 months ago
A topological characterization of weakness
Cindy Eisner, Dana Fisman, John Havlicek
SPAA
2009
ACM
15 years 6 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 15 days ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...