Add to ORKGWe provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in seriesparallel graphs (and related graph classes) with n vertices. In particular, our results extend previous results of Meir and Moon for trees [Meir, Moon: On maximal independent sets of nodes in trees, Journal of Graph Theory 1988]. We also show that these two parameters converge to a central limit law.Postprint (author's final draft
AbstractWe derive closed formulas for the numbers of independent sets of size at most 4 and matching...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in h...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
The goal of this paper is to obtain quantitative results on the number and on the size of maximal in...
The goal of this paper is to obtain quantitative results on the number and on the size of maximal in...
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G=(V,E...
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G=(V,E...
We show that the number of maximal independent sets of size exactly k in any graph of size n is ...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
For a graph $G$, let $\alpha (G)$ be the cardinality of a maximum independent set, let $\mu (G)$ be ...
The problem of determining the maximum number of maximal independent sets in certain graph classes d...
The random greedy algorithm for finding a maximal independent set in a graph has been studied extens...
AbstractWe derive closed formulas for the numbers of independent sets of size at most 4 and matching...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in h...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
The goal of this paper is to obtain quantitative results on the number and on the size of maximal in...
The goal of this paper is to obtain quantitative results on the number and on the size of maximal in...
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G=(V,E...
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G=(V,E...
We show that the number of maximal independent sets of size exactly k in any graph of size n is ...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
For a graph $G$, let $\alpha (G)$ be the cardinality of a maximum independent set, let $\mu (G)$ be ...
The problem of determining the maximum number of maximal independent sets in certain graph classes d...
The random greedy algorithm for finding a maximal independent set in a graph has been studied extens...
AbstractWe derive closed formulas for the numbers of independent sets of size at most 4 and matching...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in h...