Sciweavers

TCS
2008
13 years 11 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
DAM
2007
107views more  DAM 2007»
13 years 11 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...