Linear-time counting algorithms for independent sets in chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 433-444

  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 THEORY; GRAPH THEORY; LINEAR EQUATIONS; POLYNOMIALS; SET THEORY;

#P-COMPLETENESS; CHORDAL GRAPH; COUNTING; ENUMERATION; INDEPENDENT SET; POLYNOMIAL TIME ALGORITHM;

ALGORITHMS;

EID: 33744904743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_38     Document Type: Conference Paper

References (17)

1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the Desirability of Acyclic Database Schemes. Journal of the ACM, 30:479-513, 1983.
2. J.R.S. Blair and B. Peyton. An Introduction to Chordal Graphs and Clique Trees. In Graph Theory and Sparse Matrix Computation, volume 56 of IMA, pages 1-29. (Ed. A. George and J.R. Gilbert and J.W.H. Liu), Springer, 1993.
3. A. Brandstädt, V.B. Le, and J.R Spinrad. Graph Classes: A Survey. SIAM, 1999.
4. P. Buneman. A Characterization of Rigid Circuit Graphs. Discrete Mathematics, 9:205-212, 1974.
5. L.S. Chandran. A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. In COCOON 2001, pages 308-317. Lecture Notes in Computer Science Vol. 2108, Springer-Verlag, 2001.
6. L.S. Chandran, L. Ibarra, F. Ruskey, and J. Sawada. Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph. Theoretical Computer Science, 307:303-317, 2003.
7. D. Eppstein. All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs. In Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 451-459. ACM, 2005.
8. M. Farber. Independent Domination in Chordal Graphs. Operations Research Letters, 1(4):134-138, 1982.
9. J. Flum and M. Grohe. The Parameterized Complexity of Counting Problems. SIAM Journal on Computing, 33(4):892-922, 2004.
10. D.R. Fulkerson and O.A. Gross. Incidence Matrices and Interval Graphs. Pacific J. Math., 15:835-855, 1965.
11. F. Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM Journal on Computing, 1(2):180-187, 1972.
12. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics 57. Elsevier, 2nd edition, 2004.
13. P.N.Klein. Efficient Parallel Algorithms for Chordal Graphs. SIAM Journal on Computing, 25(4):797-827, 1996.
14. J.Y.-T. Leung. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs. Journal of Algorithms, 5:22-35, 1984.
15. J.S. Provan and M.O. Ball. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing, 12:777-788, 1983.
16. J.P. Spinrad. Efficient Graph Representations. American Mathematical Society, 2003.
17. S.P. Vadhan. The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing, 31(2):398-427, 2001.