A Worst-Case Time Upper Bound for Counting the Number of Independent Sets

DOI10.1007/978-3-540-77294-1_9zbMath1136.05314OpenAlexW1491212211MaRDI QIDQ5458508

Guillermo de Ita, Aurelio López-López

Publication date: 15 April 2008

Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77294-1_9

zbMATH Keywords

Graph TheoryCounting the Number of Independent SetsExact Counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: A Worst-Case Time Upper Bound for Counting the Number of Independent Sets