Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
Screen decoration graphicsLogo

The complexity of the minimum k-cover problem

Cole, Richard and Iliopoulos, Costas S. and Mohamed, Manal and Smyth , W. F. and Yang, Lu (2005) The complexity of the minimum k-cover problem. Journal of Automata, Languages & Combinatorics, 10 (5). pp. 641-653. (In Press)

Full text not available from this repository.

Item Type:Article
ID Code:559
Deposited By:Dr Manal Mohamed
Deposited On:02 Nov 2007 17:16
Last Modified:02 Nov 2007 17:16

Repository Staff Only: item control page