We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques...
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...