"Approximately counting independent sets in bipartite graphs via graph ..."

Matthew Jenssen, Will Perkins, Aditya Potukuchi (2023)

> Home

Details and statistics

DOI: 10.1002/RSA.21145

access: closed

type: Journal Article

metadata version: 2024-01-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/JenssenPP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/JenssenPP23
Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.