APA (7th ed.) Citation

Jenssen, M., Perkins, W., & Potukuchi, A. (2023). Approximately counting independent sets in bipartite graphs via graph containers. Random structures & algorithms, 63(1), 215-241. https://doi.org/10.1002/rsa.21145

Chicago Style (17th ed.) Citation

Jenssen, Matthew, Will Perkins, and Aditya Potukuchi. "Approximately Counting Independent Sets in Bipartite Graphs via Graph Containers." Random Structures & Algorithms 63, no. 1 (2023): 215-241. https://doi.org/10.1002/rsa.21145.

MLA (9th ed.) Citation

Jenssen, Matthew, et al. "Approximately Counting Independent Sets in Bipartite Graphs via Graph Containers." Random Structures & Algorithms, vol. 63, no. 1, 2023, pp. 215-241, https://doi.org/10.1002/rsa.21145.