"Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs."

Jana Novotná et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00745-Z

access: closed

type: Journal Article

metadata version: 2021-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/NovotnaOPRLW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/NovotnaOPRLW21
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021)

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.