Generating all the acyclic orientations of an undirected graph
Let G be an undirected graph with n vertices, m edges and alpha acyclic orientations. We describe an algorithm for finding all these orientations in overall time O((n + m)alpha) and delay complexity O(n(n + m)). The space required is O(n + m). (C) 1999 Published by Elsevier Science B.V. All rights reserved.
acyclic orientations graphs algorithms