"The parameterised complexity of counting even and odd induced subgraphs."

Mark Jerrum, Kitty Meeks (2017)

> Home

Details and statistics

DOI: 10.1007/S00493-016-3338-5

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/JerrumM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/JerrumM17
Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. Comb. 37(5): 965-990 (2017)

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.