Enumerating Cyclic Orientations of a Graph

  • Alessio ConteEmail author
  • Roberto Grossi
  • Andrea Marino
  • Romeo Rizzi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9538)


Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the problem of efficiently enumerating all the cyclic orientations of an undirected connected graph with n vertices and m edges, observing that it cannot be solved using algorithmic techniques previously employed for enumerating acyclic orientations. We show that the problem is of independent interest from both combinatorial and algorithmic points of view, and that each cyclic orientation can be listed with \(\tilde{O}(m)\) delay time. Space usage is O(m) with an additional setup cost of \(O(n^2)\) time before the enumeration begins, or O(mn) with a setup cost of \(\tilde{O}(m)\) time.


  1. 1.
    Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: ALENEX/ANALC, vol. 69 (2004)Google Scholar
  2. 2.
    Alon, N., Tuza, Z.: The acyclic orientation game on random graphs. Random Struct. Algorithms 6(2–3), 261–268 (1995)CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    Barbosa, V.C., Szwarcfiter, J.L.: Generating all the acyclic orientations of an undirected graph. Inf. Process. Lett. 72(1), 71–74 (1999)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Bollobas, B.: Extremal Graph Theory. Dover Publications Incorporated, New York (2004)zbMATHGoogle Scholar
  5. 5.
    Erdős, P., Pósa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3–12 (1962)MathSciNetGoogle Scholar
  6. 6.
    Fisher, D.C., Fraughnaugh, K., Langley, L., West, D.B.: The number of dependent arcs in an acyclic orientation. J. Comb. Theor. Ser. B 71(1), 73–78 (1997)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119–123 (1988)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    Linial, N.: Hard enumeration problems in geometry and combinatorics. SIAM J. Algeb. Discrete Meth. 7(2), 331–335 (1986)CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    Moon, J.: Topics on tournaments. In: Selected Topics in Mathematics. Athena series. Holt, Rinehart and Winston (1968)Google Scholar
  11. 11.
    Pikhurko, O.: Finding an unknown acyclic orientation of a given graph. Comb. Probab. Comput. 19(1), 121–131 (2010)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Squire, M.B.: Generating the acyclic orientations of a graph. J. Algorithms 26(2), 275–290 (1998)CrossRefMathSciNetzbMATHGoogle Scholar
  13. 13.
    Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 5(2), 171–178 (1973)CrossRefMathSciNetzbMATHGoogle Scholar
  14. 14.
    Tarjan, R.E.: A note on finding the bridges of a graph. Inf. Process. Lett. 2(6), 160–161 (1974)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Alessio Conte
    • 1
    Email author
  • Roberto Grossi
    • 1
  • Andrea Marino
    • 1
  • Romeo Rizzi
    • 2
  1. 1.Università di PisaPisaItaly
  2. 2.Università di VeronaVeronaItaly

Personalised recommendations