Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...