TY - JOUR
T1 - The acyclic orientation game on random graphs
AU - Alon, Noga
AU - Tuza, Zsolt
PY - 1995
Y1 - 1995
N2 - It is shown that in the random graph Gnp 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.
AB - It is shown that in the random graph Gnp 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.
UR - http://www.scopus.com/inward/record.url?scp=84990662390&partnerID=8YFLogxK
U2 - 10.1002/rsa.3240060213
DO - 10.1002/rsa.3240060213
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84990662390
SN - 1042-9832
VL - 6
SP - 261
EP - 268
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 2-3
ER -