The Acyclic Orientation Game on Random Graphs

It is shown that in the random graph Gn p with (fixed) edge probability p > 0, the number of edges that have to be examined in order to identify an acyclic orientation is θ(n log n) almost surely. For unrestricted p, an upper bound of O(n log3n) is established. Graphs G = (V, E) in which all edges have to be examined are considered, as well. © 1995 Wiley Periodicals, Inc.

[1]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2]  Udi Manber,et al.  The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  János Komlós,et al.  Almost Sorting in one Round , 1989, Adv. Comput. Res..

[4]  Nicholas Pippenger,et al.  Sorting and Selecting in Rounds , 1987, SIAM J. Comput..

[5]  Leonard J. Schulman,et al.  Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph , 1996, Comb..

[6]  Noga Alon,et al.  Parallel comparison algorithms for approximation problems , 1991, Comb..

[7]  Zsolt Tuza,et al.  Searching for acyclic orientations of graphs , 1995, Discret. Math..

[8]  Noga Alon,et al.  Sorting, Approximate Sorting, and Searching in Rounds , 1988, SIAM J. Discret. Math..