Journal article

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

de Klerk, E., Pasechnik, D., & Warners, J. (2004). On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function. J. Comb. Optim., 8(3), 267–294.

MLA Style

de Klerk, E, et al. “On Approximate Graph Colouring and MAX−k−CUT Algorithms Based on the ϑ−Function.” J. Comb. Optim., vol. 8, no. 3, 2004, pp. 267–94.

Chicago Style

Klerk, E de, D Pasechnik, and J Warners. 2004. “On Approximate Graph Colouring and MAX−k−CUT Algorithms Based on the ϑ−Function.” J. Comb. Optim. 8 (3): 267–94.
Print

Authors

+ de Klerk, E More by this author

Role:: Author

+ Pasechnik, D More by this author

Role:: Author

+ Warners, J More by this author

Role:: Author

Journal:: J. Comb. Optim. More from this journal
Volume:: 8
Issue:: 3
Pages:: 267-294
Publication date:: 2004-01-01
ISSN:: 1382-6905

UUID:: uuid:0b660a20-54ab-41f1-9ea3-a38a8a9aadf1
Local pid:: cs:7276
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_0b660a2054ab41f19ea3a38a8a9aadf1

Terms of use

Copyright date:: 2004

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP