𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List Coloring of Random and Pseudo-Random Graphs

✍ Scribed by Noga Alon; Michael Krivelevich; Benny Sudakov

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
317 KB
Volume
19
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random coloring evolution on graphs
Random coloring evolution on graphs
✍ Xin Xing Chen; Jian Gang Ying πŸ“‚ Article πŸ“… 2010 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 178 KB
On-Line Coloring of Sparse Random Graphs
On-Line Coloring of Sparse Random Graphs and Random Trees
✍ Boris Pittel; Robert S. Weishaar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 164 KB

The performance of the greedy coloring algorithm ''first fit'' on sparse random graphs G and on random trees is investigated. In each case, approximately n, c r n log log n colors are used, the exact number being concentrated almost surely on at 2 most two consecutive integers for a sparse random gr

Algorithms for coloring semi-random grap
Algorithms for coloring semi-random graphs
✍ C. R. Subramanian; Martin FΓΌrer; C. E. Veni Madhavan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 373 KB πŸ‘ 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

Randomized online graph coloring
Randomized online graph coloring
✍ Sundar Vishwanathan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 793 KB