On Approximate Graph Colouring and MAX-k-CUT Algorithms...

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function

E. de Klerk, D.V. Pasechnik, J.P. Warners
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
8
Language:
english
Pages:
28
Journal:
Journal of Combinatorial Optimization
DOI:
10.1023/b:joco.0000038911.67280.3f
Date:
September, 2004
File:
PDF, 187 KB
english, 2004
Conversion to is in progress
Conversion to is failed