๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Hardness of Approximating the Chromatic Number

โœ Scribed by Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author)

Publisher
Janos Bolyai Mathematical Society
Year
2000
Tongue
English
Weight
311 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Hardness of Approximating the Chr
On the Hardness of Approximating the Chromatic Number
โœ Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author) ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Janos Bolyai Mathematical Society ๐ŸŒ English โš– 311 KB
On the mean chromatic number
On the mean chromatic number
โœ Martin Anthony ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

The mean chromatic number of a graph is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. Some results on the value of the mean chromatic number and its asymptotic behaviour are presented.