Durham Research Online
You are in:

Upper bounds and algorithms for parallel knock-out numbers.

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniel (2009) 'Upper bounds and algorithms for parallel knock-out numbers.', Theoretical computer science., 410 (14). pp. 1319-1327.


Item Type:Article
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1016/j.tcs.2008.03.024
Record Created:17 Apr 2009 16:20
Last Modified:02 Apr 2013 16:51

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library