The Computational Complexity of the Parallel Knock-Out Problem

DOI10.1007/11682462_26zbMath1145.68433OpenAlexW2180270269MaRDI QIDQ3525764

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

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/6130/1/6130.pdf

zbMATH Keywords

computational complexitygraphsparallel knock-out

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Eliminating graphs by means of parallel knock-out schemes

This page was built for publication: The Computational Complexity of the Parallel Knock-Out Problem