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]
@inproceedings{BroersmaJP07,
title = {Upper Bounds and Algorithms for Parallel Knock-Out Numbers},
author = {Hajo Broersma and Matthew Johnson 0002 and Daniël Paulusma},
year = {2007},
doi = {10.1007/978-3-540-72951-8_26},
url = {http://dx.doi.org/10.1007/978-3-540-72951-8_26},
researchr = {https://researchr.org/publication/BroersmaJP07},
cites = {0},
citedby = {0},
pages = {328-340},
booktitle = {Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings},
editor = {Giuseppe Prencipe and Shmuel Zaks},
volume = {4474},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-72918-1},
}