@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",
keyword = "chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm",
link = "http://link.springer.com/chapter/10.1007/11604686_38",
month = "jun",
pages = "433--444",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Linear time counting algorithms for independent sets in chordal graphs",
uri = "http://link.springer.com/chapter/10.1007/11604686_38",
volume = "3787",
year = "2005",
}