H.J. Broersma
Upper Bounds and Algorithms for Parallel Knock-Out Numbers
Broersma, H.J.; Johnson, M.; Paulusma, D.
Citation
Broersma, H., Johnson, M., & Paulusma, D. (2007, June). Upper Bounds and Algorithms for Parallel Knock-Out Numbers. Presented at SIROCCO 2007: Structural Information and Communication Complexity, Castiglioncello, Italy
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | SIROCCO 2007: Structural Information and Communication Complexity |
Start Date | Jun 5, 2007 |
End Date | Jun 8, 2007 |
Publication Date | 2007 |
Deposit Date | Dec 21, 2014 |
Print ISSN | 0302-9743 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 4474 |
Pages | 328-340 |
Book Title | Structural Information and Communication Complexity |
ISBN | 978-3-540-72918-1 |
DOI | https://doi.org/10.1007/978-3-540-72951-8_26 |
Public URL | https://durham-repository.worktribe.com/output/1154444 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search