Generating all the acyclic orientations of an undirected graph

Information Processing Letters

Volumn 72, Issue 1-2, 1999, Pages 71-74

  Barbosa, Valmir C ^a   Szwarcfiter, Jayme L ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Acyclic orientations; Algorithms; Graphs

Indexed keywords

EID: 0010314031     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00120-9     Document Type: Article

References (7)

1. V.C. Barbosa, Massively Parallel Models of Computation, Ellis Horwood, Chichester, UK, 1993.
2. V.C. Barbosa, E. Gafni, Concurrency in heavily loaded neighborhood-constrained systems, ACM Trans. Program. Languages Systems 11 (1989) 562-584.
3. V.C. Barbosa, J.L. Szwarcfiter, Generating all the acyclic orientations of an undirected graph, T.R. ES-405/96, COPPE/UFRJ, Rio de Janeiro, Brazil, August 1996.
4. D.E. Knuth, The Art of Computer Programming 1: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1969 (2nd edn., 1973).
5. M.B. Squire, Generating all the acyclic orientations of a graph, J. Algorithms 26 (1998) 275-290.
6. R.P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973) 171-178.
7. K.-P. Vo, Graph colourings and acyclic orientations, Linear Multilinear Algebra 22 (1987) 161-170.