Rita M. del Río-Chanona

  • Citations Per Year
Learn More
Information gathering by crawlers on the web is of practical interest. We consider a simplified model for crawling complex networks such as the web graph, which is a variation of the robot vacuum edge-cleaning process of Messinger and Nowakowski. In our model, a crawler visits nodes via a deterministic walk determined by their weightings which change during(More)
The injective chromatic number of a graph G is the minimum number of colours needed to colour the vertices of G so that two vertices with a common neighbour receive distinct colours. In this paper, we investigate the injective chromatic number of the binomial random graph G(n, p) for a wide range of p. We also study a natural generalization of this graph(More)
  • 1