"Weighted Counting of Matchings in Unbounded-Treewidth Graph Families."

Antoine Amarilli, Mikaël Monet (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2022.9

access: open

type: Conference or Workshop Paper

metadata version: 2022-09-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/AmarilliM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/AmarilliM22
Antoine Amarilli, Mikaël Monet:
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS 2022: 9:1-9:15

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.