Linear time counting algorithms for independent sets in chordal graphs. Okamoto, Y, Uno, T, & Uehara, R In WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, volume 3787, of Lecture Notes in Computer Science, pages 433--444, Metz, France, June, 2005. Springer Berlin Heidelberg.
Linear time counting algorithms for independent sets in chordal graphs [link]Paper  doi  bibtex   
@inproceedings{ Okamoto2005a,
  address = {Metz, France},
  author = {Okamoto, Y and Uno, T and Uehara, R},
  booktitle = {WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science},
  doi = {10.1007/11604686_38},
  editor = {Kratsch, Dieter},
  file = {:Users/KunihiroWASA/Dropbox/paper/2005/Okamoto, Uno, Uehara, Linear time counting algorithms for independent sets in chordal graphs, 2005.pdf:pdf},
  keywords = {chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm},
  month = {June},
  pages = {433--444},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Linear time counting algorithms for independent sets in chordal graphs}},
  url = {http://link.springer.com/chapter/10.1007/11604686_38},
  volume = {3787},
  year = {2005}
}
Downloads: 0