📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Upper Bounds and Algorithms for Parallel Knock-Out Numbers

First Author: Broersma H

Attributed to: Exact algorithms for NP-hard problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-72951-8_26

Publication URI: http://dx.doi.org/10.1007/978-3-540-72951-8_26

Type: Book Chapter

Book Title: Structural Information and Communication Complexity (2007)

Page Reference: 328-340

ISBN: 978-3-540-72918-1

ISSN: 1080-5370