Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The computational complexity of the parallel knock-out problem."

Hajo Broersma et al. (2008)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2007.11.021

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/BroersmaJPS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BroersmaJPS08
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008)

a service of

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.