Opening book details…
Can I read On-Line Coloring of Sparse Random Graphs and Random Trees on EtoBox?
On-Line Coloring of Sparse Random Graphs and Random Trees by Boris Pittel; Robert S. Weishaar is a Computer Science article available to read on EtoBox.
What is On-Line Coloring of Sparse Random Graphs and Random Trees about?
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 graph and on at most three consecutive integers for a random tree.
Who reads On-Line Coloring of Sparse Random Graphs and Random Trees?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Boris Pittel; Robert S. Weishaar
- Publisher
- Elsevier Science; Elsevier ; Academic Press; Elsevier BV (ISSN 0196-6774)
- Published
- 1997
- Language
- EN
- Field
- Computer Science (Physical Sciences)