The acyclic orientation game on random graphs

Noga Alon, Z. Tuza

Research output: Contribution to journalArticle

10 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)261-268
Number of pages8
JournalRandom Structures & Algorithms
Issue number2-3
Publication statusPublished - 1995


ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Cite this