TY - GEN A1 - Behrisch, Michael A1 - Taraz, Anusch A1 - Ueckerdt, Michael T1 - Colouring random intersection graphs and complex networks N2 - Random intersection graphs naturally exhibit a certain amount of transitivity and hence can be used to model real--world networks. We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be coloured optimally with high probability using different greedy algorithms. Experiments on real network data confirm the positive theoretical predictions and suggest that heuristics for the clique and the chromatic number can work hand in hand proving mutual optimality. KW - random graphs KW - colouring KW - intersection graphs KW - complex networks Y1 - 2006 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/308 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-3087 ER -