default search action

combined dblp search
author search
venue search
publication search

ask others

"Counting Connected Subgraphs with Maximum-Degree-Aware Sieving."

Andreas Björklund et al. (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2018.17

access: open

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/BjorklundHKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/BjorklundHKK18
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC 2018: 17:1-17:12

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.