Upper Bounds and Algorithms for Parallel Knock-Out Numbers

Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma. Upper Bounds and Algorithms for Parallel Knock-Out Numbers. In Giuseppe Prencipe, Shmuel Zaks, editors, Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings. Volume 4474 of Lecture Notes in Computer Science, pages 328-340, Springer, 2007. [doi]

Authors

Hajo Broersma

This author has not been identified. Look up 'Hajo Broersma' in Google

Matthew Johnson 0002

This author has not been identified. Look up 'Matthew Johnson 0002' in Google

Daniël Paulusma

This author has not been identified. Look up 'Daniël Paulusma' in Google