"The Computational Complexity of the Parallel Knock-Out Problem."

Hajo Broersma et al. (2006)

> Home

Details and statistics

DOI: 10.1007/11682462_26

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/BroersmaJPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/BroersmaJPS06
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261

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.