Generating the Acyclic Orientations of a Graph
Author:
- Matthew B SquireMSMatthew B Squire
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 26 (2) , 275-290
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A Gray Code for the Ideals of a Forest PosetJournal of Algorithms, 1993
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliabilityDiscrete Mathematics, 1993
- Gray codes from antimatroidsOrder, 1993
- Orientation of Signed GraphsEuropean Journal of Combinatorics, 1991
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Network reliability and acyclic orientationsNetworks, 1984
- On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphsTransactions of the American Mathematical Society, 1983
- Permutation Generation MethodsACM Computing Surveys, 1977
- Algorithm 466: four combinatorial algorithm [G6]Communications of the ACM, 1973
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial ConfigurationsJournal of the ACM, 1973