The Computational Complexity of the Parallel Knock-Out Problem

Hajo Broersma
, Matthew Johnson
, Daniël Paulusma
, Iain A. Stewart

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

1 Downloads (Pure)

2 Citations
1 Article

1 results

2008
The computational complexity of the parallel knock-out problem
Broersma, H., Johnson, M., Paulusma, D. & Stewart, I. A., Mar 2008, In: Theoretical computer science. 393, 1-3, p. 182-195 14 p.
Research output: Contribution to journal › Article › Academic › peer-review
5 Link opens in a new tab Citations (Scopus)

7 Downloads (Pure)