288 search results - page 18 / 58 » On the number of maximal independent sets in a graph |
164
click to vote
FOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
198
click to vote
IWPEC
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
168
click to vote
SIGECOM
2009
ACM
16 years 18 days ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
183
click to vote
EGPGV
2004
Springer
15 years 11 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
191
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...