Efficient algorithms for listing unlabeled graphs
- 31 March 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (1) , 128-143
- https://doi.org/10.1016/0196-6774(92)90009-2
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On generating all maximal independent setsInformation Processing Letters, 1988
- Generating Random Unlabelled GraphsSIAM Journal on Computing, 1987
- The random selection of unlabeled graphsJournal of Algorithms, 1983
- Orderly algorithms for generating restricted classes of graphsJournal of Graph Theory, 1979
- Orderly algorithms for graph generationInternational Journal of Computer Mathematics, 1979
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial ConfigurationsPublished by Elsevier ,1978