The Computational Complexity of the Parallel Knock-Out Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/11682462_26
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg