"Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time."

Andreas Björklund, Petteri Kaski, Lukasz Kowalik (2017)

> Home

Details and statistics

DOI: 10.1145/3125500

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/BjorklundKK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BjorklundKK17
Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13(4): 48:1-48:26 (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.