𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clustering in random line graphs

✍ Scribed by Anna Mańka-Krasoń; Advera Mwijage; Krzysztof Kułakowski

Book ID
108107579
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
221 KB
Volume
181
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Graphs with Clustering
Random Graphs with Clustering
✍ Newman, M. E. J. 📂 Article 📅 2009 🏛 The American Physical Society 🌐 English ⚖ 147 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