683 search results - page 11 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
100
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
114
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
BMCBI
2005
14 years 11 months ago
2005
Background: Life processes are determined by the organism's genetic profile and multiple environmental variables. However the interaction between these factors is inherently ...
SIGECOM
2003
ACM
15 years 4 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
118
click to vote
ECCC
2011
14 years 5 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...