Counting the number of independent sets in chordal graphs

Journal of Discrete Algorithms

Volumn 6, Issue 2, 2008, Pages 229-242

  Okamoto, Yoshio ^a   Uno, Takeaki ^b   Uehara, Ryuhei ^c  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

P completeness; Chordal graph; Counting; Enumeration; Independent set; NP completeness; Polynomial time algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; NUMBER THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

CHORDAL GRAPHS; COUNTING; ENUMERATION; INDEPENDENT SET; NP COMPLETENESS; POLYNOMIAL TIME ALGORITHMS;

GRAPH THEORY;

EID: 42249090361     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.07.006     Document Type: Article

References (22)

1. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. Journal of the ACM 30 (1983) 479-513
2. Blair J.R.S., and Peyton B. An introduction to chordal graphs and clique trees. In: George A., Gilbert J.R., and Liu J.W.H. (Eds). Graph Theory and Sparse Matrix Computation. IMA vol. 56 (1993), Springer 1-29
3. Brandstädt A., Le V.B., and Spinrad J.P. Graph Classes: A Survey (1999), SIAM
4. Buneman P. A characterization of rigid circuit graphs. Discrete Mathematics 9 (1974) 205-212
5. Chandran L.S. A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. COCOON 2001. Lecture Notes in Computer Science vol. 2108 (2001), Springer 308-317
6. Chandran L.S., Ibarra L., Ruskey F., and Sawada J. Generating and characterizing the perfect elimination orderings of a chordal graph. Theoretical Computer Science 307 (2003) 303-317
7. Chang G.J. The weighted independent domination problem is NP-complete for chordal graphs. Discrete Applied Mathematics 143 (2004) 351-352
8. Eppstein D. All maximal independent sets and dynamic dominance for sparse graphs. Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (2005), ACM 451-459
9. Farber M. Independent domination in chordal graphs. Operations Research Letters 1 4 (1982) 134-138
10. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 45 4 (1998) 634-652
11. Flum J., and Grohe M. The parameterized complexity of counting problems. SIAM Journal on Computing 33 4 (2004) 892-922
12. Fulkerson D.R., and Gross O.A. Incidence matrices and interval graphs. Pacific Journal of Mathematics 15 (1965) 835-855
13. Gavril F. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing 1 2 (1972) 180-187
14. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics. second ed. vol. 57 (2004), Elsevier
15. Klein P.N. Efficient parallel algorithms for chordal graphs. SIAM Journal on Computing 25 4 (1996) 797-827
16. Leung J.Y.-T. Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. Journal of Algorithms 5 (1984) 22-35
17. Nakano S., and Uno T. Constant time generation of trees with specified diameter. Graph-Theoretic Concepts in Computer Science (WG 2004). Lecture Notes in Computer Science vol. 3353 (2005), Springer 33-45
18. Provan J.S., and Ball M.O. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing 12 (1983) 777-788
19. Rose D.J., Tarjan R.E., and Lueker G.S. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing 5 2 (1976) 266-283
20. Spinrad J.P. Efficient Graph Representations (2003), American Mathematical Society
21. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13 3 (1984) 566-579
22. Vadhan S.P. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing 31 2 (2001) 398-427