Ebrahim Malalla

  • Citations Per Year
Learn More
Let G(n,m) be an undirected random graph with n vertices and m multiedges that may include loops, where each edge is realized by choosing its two vertices independently and uniformly at random with replacement from the set of all n vertices. The random graph G(n,m) is said to be k-orientable, where k ≥ 2 is an integer, if there exists an orientation of the(More)
We analyze the performance of the randomized multiple- choice allocation process in the fixed density model. We show that the allocation process leads to O(log log n) expected maximal bin load when Theta(n) balls are allocated into n bins, where each ball is inserted into the less loaded bin among two bins chosen independently and according to two fixed but(More)
Let G(n,m) be an undirected random graph with n vertices and m multiedges that may include loops, where each edge is realized by choosing its two vertices independently and uniformly at random with replacement from the set of all n vertices. The random graph G(n,m) is said to be k-orientable, where k ges 2 is an integer, if there exists an orientation of(More)
  • 1