4171 search results - page 386 / 835 » Choice numbers of graphs |
267
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
171
click to vote
SC
2009
ACM
16 years 1 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
211
click to vote
SIGMOD
2005
ACM
16 years 17 days ago
2005
ACM
If presented with inaccurate statistics, even the most sophisticated query optimizers make mistakes. They may wrongly estimate the output cardinality of a certain operation and th...
184
click to vote
SIGECOM
2010
ACM
15 years 12 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
204
click to vote
MOBICOM
2000
ACM
15 years 11 months ago
2000
ACM
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...