288 search results - page 1 / 58 » On the number of maximal independent sets in a graph |
CORR
2011
Springer
13 years 6 months ago
2011
Springer
JGT
2006
13 years 11 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
DC
2010
13 years 11 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
GBRPR
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...