Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of independent sets of a fixed size. With similar ideas, we show that enumeration (namely, listing) of the independent sets, the maximum independent sets, and the independent sets of a fixed size in a chordal graph can be done in constant amortized time per output. On the other hand, we prove that the following problems for a chordal graph are # P-complete: (1) counting the number of maximal independent sets; (2) counting the number of minimum maximal independent sets. With similar ideas, we also show that finding a minimum weighted maximal independent set in a chordal graph is NP-hard, and even hard to approximate.
KeywordsChordal graph counting enumeration independent set NP-completeness # P-completeness polynomial time algorithm
Unable to display preview. Download preview PDF.
- 2.Blair, J.R.S., Peyton, B.: An Introduction to Chordal Graphs and Clique Trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. IMA, vol. 56, pp. 1–29. Springer, Heidelberg (1993)Google Scholar
- 7.Eppstein, D.: All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs. In: Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 451–459. ACM, New York (2005)Google Scholar