Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/48230
Title: Some NP-complete graph problems with applications in the machine scheduling problems
Authors: Yuan, JJ
Cheng, TCE 
Ng, CT 
Issue Date: 2001
Source: The First Mainland-Taiwan Joint International Conference on Graph Theory and Combinations, Kunming, China, 22-27 June 2001, p. 1-11 How to cite?
URI: http://hdl.handle.net/10397/48230
Appears in Collections:Conference Paper

Show full item record

Page view(s)

42
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.