✦ LIBER ✦

Coloring Random Intersection Graphs and Complex Networks

✍ Scribed by Behrisch, Michael; Taraz, Anusch; Ueckerdt, Michael

Book ID: 118196923
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 192 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/050647153

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

List Coloring of Random and Pseudo-Rando

List Coloring of Random and Pseudo-Random Graphs

✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 317 KB

Treewidth of Erdős–Rényi random graphs,

Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs

✍ Yong Gao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Random coloring evolution on graphs

✍ Xin Xing Chen; Jian Gang Ying 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 178 KB

Complex networks: Structure comes to ran

Complex networks: Structure comes to random graphs

✍ D'Souza, Raissa M. 📂 Article 📅 2009 🏛 Nature Publishing Group 🌐 English ⚖ 158 KB

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

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