Guillermo De Ita, Aurelio López-López. A Worst-Case Time Upper Bound for Counting the Number of Independent Sets. In Jeannette C. M. Janssen, Pawel Pralat, editors, Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Volume 4852 of Lecture Notes in Computer Science, pages 85-98, Springer, 2007. [doi]
@inproceedings{ItaL07,
title = {A Worst-Case Time Upper Bound for Counting the Number of Independent Sets},
author = {Guillermo De Ita and Aurelio López-López},
year = {2007},
doi = {10.1007/978-3-540-77294-1_9},
url = {http://dx.doi.org/10.1007/978-3-540-77294-1_9},
researchr = {https://researchr.org/publication/ItaL07},
cites = {0},
citedby = {0},
pages = {85-98},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers},
editor = {Jeannette C. M. Janssen and Pawel Pralat},
volume = {4852},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77293-4},
}