Login / Signup
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.
Arnaud Pêcher
Annegret Katrin Wagler
Published in:
Electron. Notes Discret. Math. (2009)
Keyphrases
</>
computational complexity
data mining
real time
color images
shortest path
approximation algorithms
fixed number