Generating the acyclic orientations of a graph

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 275-290

  Squire, Matthew B ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347647279     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0891     Document Type: Article

References (27)

1. T. Beyer and F. Ruskey, Constant average time generation of subtrees of bounded size, unpublished manuscript, 1989.
2. G. Brightwell and P. Winkler, Counting linear extensions is #P-complete, Order 8 (1992), 225-242.
3. n dissected by hyperplanes, Trans. Am. Math. Soc. 283 (1984), 617-631.
4. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, New York, 1987.
5. H. Edelsbrunner and L. Guibas, Topologically sweeping an arrangement, in "ACM Symposium on Theory of Computing (STOC)," 1986.
6. G. Ehrlich, Algorithm 466: Four combinatorial algorithms, Comm. ACM 16 (1973), 690-691.
7. G. Ehrlich, Loopless algorithms for generating permutations, combinations, and other combinatorial configurations, J. Assoc. Comput. Mach. 20(1973), 500-513.
8. C. Greene, Acyclic orientations (Notes), in "Higher Combinatorics" (M. Aigner, Ed.), pp. 65-68, Reidel, Dordrecht, 1976.
9. C. Greene and T. Zaslavsky, On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs, Trans. Amer. Math. Soc. 280 (1983), 97-126.
10. R. Johnson, Network reliability and acyclic orientations, Networks 14 (1984), 489-505.
11. S. Johnson, Generation of permutations by adjacent transpositions, Math. Comput. 17 (1963), 282-285.
12. Y. Koda and F. Ruskey, A Gray code for the ideals of a forest poset, J. Algorithms 15 (1993), 324-340.
13. N. Linial, Hard enumeration problems in geometry and combinatorics, SIAM J. Algorithmic Discrete Methods 7 (1986), 331-335.
14. G. Pruesse and F. Ruskey, Generating the linear extensions of certain posets by transpositions, SIAM J. Discrete Math. 4 (1991), 413-422.
15. G. Pruesse and F. Ruskey, Gray codes from antimatroids, Order 10 (1993), 239-252.
16. G. Pruesse and F. Ruskey, The prism of the acyclic orientation graph is hamiltonian, preprint, 1994.
17. J. Rodriguez and A. Satyanarayana, A generalized chromatic polynomial, acydic orientationswith prescribed sources and sinks, and network reliability, Discrete Math. 112 (1993), 185-197.
18. C. D. Savage, M. B. Squire, and D. B. West, Gray code results for acyclic orientations, Congr. Numer. 96 (1993), 185-204.
19. R. Sedgewick, Permutation generation methods, Comput Surveys 9 (1977), 137-164.
20. M. B. Squire, "Combinatorial Gray Codesand Efficient Generation," technical report 94-17, North Carolina State University, 1994.
21. M. B. Squire, Enumerating the ideals of a poset, submitted for publication.
22. M. B. Squire, "Two New Gray Codes for Acydic Orientations," technical report 94-14, North Carolina State University, 1994.
23. R. P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973), 171-178.
24. G. Steiner, An algorithm to generate the ideals of a partial order, Oper. Res. Lett. 5 (1986), 317-320.
25. H. F. Trotter, Algorithm 115 perm, Comm. ACM 5 (1962), 434-435.
26. W. T. Trotter, "Combinatorics and Partially Ordered Sets," Johns Hopkins Press, Baltimore, 1992.
27. T. Zaslavsky, Orientation of signed graphs, European J. Combin. 12 (1991), 361-375.