288 search results - page 15 / 58 » On the number of maximal independent sets in a graph |
101
click to vote
AI
2006
Springer
14 years 9 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— This paper is focused on the influence of geometry on the combination of inter-cell and intra-cell interferences in the downlink of large cdma networks. We use an exact repres...
101
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
SIAMJO
2008
14 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
PODC
2011
ACM
14 years 19 days ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...