"Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t ..."

Gábor Bacsó et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0479-5

access: open

type: Journal Article

metadata version: 2025-09-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BacsoLMPTL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BacsoLMPTL19
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019)

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.