The cycle colouring problem is NP-complete / Luke O'Connor.
The cycle colouring problem is NP-complete / Luke O'Connor.
About this item
Full title
The cycle colouring problem is NP-complete / Luke O'Connor.
Author / Creator
Publisher
[Sydney] : Basser Dept. of Computer Science, University of Sydney, 1988.
Date
1988.
Call Numbers
N511.5/7
Record Identifier
74VvgdyaBNWX
MMS ID
991012190299702626
Language
English
Formats
Physical Description
Physical content
22 p. : ill. ; 21 cm.
Publication information
Publisher
[Sydney] : Basser Dept. of Computer Science, University of Sydney, 1988.
Place of Publication
New South Wales
Date Published
1988.
Subjects
More information
Alternative Titles
Full title
The cycle colouring problem is NP-complete / Luke O'Connor.
Authors, Artists and Contributors
Author / Creator
Author / Artists
Notes
General note
Technical report / Basser Department of Computer Science, University of Sydney ; 327.
Bibliography: p. 22.
Identifiers
Primary Identifiers
Call Numbers
N511.5/7
Record Identifier
74VvgdyaBNWX
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/74VvgdyaBNWX
Other Identifiers
ISBN
0949100560 :
9780949100566 :
MMS ID
991012190299702626
How to access this item
1 of 0Request as a Library member
